{ "schema_version": 1, "builder_plan": { "scenario": "A self-hosted model uses more compute or memory than your workload can justify.", "change": "Check for a usable pruned checkpoint and runtime support before attempting model surgery.", "baseline": "The original unpruned model at the same precision, context, and load.", "steps": [ "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.", "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.", "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.", "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test." ], "measure": "Task quality, actual GPU memory, serving throughput, and preparation cost.", "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation." }, "builder_review": null, "arxiv_id": "2609.21523", "title": "What Must Survive? Exact Task-Information--State Frontiers for Resource-Sufficient Learning", "summary": "The paper characterizes, rather than implements, the exact minimal state dimension for linear task families when a task message is revealed before compression, replacing heuristic dimensionality reduction with a provable partition-based frontier. It costs solving a strongly NP-hard partition problem (inapproximable at any fixed tolerance), so practical use requires approximate singular-value heuristics whose gap to the exact frontier is instance-dependent. Adoption can fail because the results hold only for finite families of linear tasks, the demonstrated gains come from constructed examples rather than production models, and real neural workloads rarely expose the required joint task operators in advance.", "rationale": "This is a theoretical optimality result for linear-task compression with NP-hard computation, offering design insight but no validated, deployable method for constrained-infrastructure production use.", "technique": "Task-advised state compression via low-rank partition frontiers", "family": "esparsidade_e_poda", "recommendation": "observar", "published": "2026-09-18", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.21523", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "The paper characterizes, rather than implements, the exact minimal state dimension for linear task families when a task message is revealed before compression, replacing heuristic dimensionality reduction with a provable partition-based frontier. It costs solving a strongly NP-hard partition problem (inapproximable at any fixed tolerance), so practical use requires approximate singular-value heuristics whose gap to the exact frontier is instance-dependent. Adoption can fail because the results hold only for finite families of linear tasks, the demonstrated gains come from constructed examples rather than production models, and real neural workloads rarely expose the required joint task operators in advance.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.21523", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "With nine bits of advance task information, a constructed attention example reduces required state exactly from 524,288 to 1,024 coordinates (512x); a hierarchical multi-task example reduces state from 3,136 to 448 coordinates (7x) with three bits, approaching a 328-coordinate floor.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.21523", "source_page": null, "source_excerpt": "" } ], "exposure_map": [ { "dimension": "quality", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compute", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "latency", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "operations", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "compatibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "security", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "data_and_training", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" }, { "dimension": "reproducibility", "basis": "not_evaluated", "finding": "", "interpretation": "", "limitation": "", "next_check": "", "source_url": "", "source_page": null, "source_excerpt": "" } ], "risks": [], "minimum_test": [], "open_questions": [], "independent_tests": [], "lab_reproductions": [], "report_available": false, "validation_tier": "unknown", "evidence_tier": "unknown", "infrastructure_basis": "unknown", "equations": [], "equations_status": "not_fetched", "core_kind": "", "equations_fetched_at": "", "equations_source_url": "", "equations_source_sha256": "", "exposures_reviewed_at": "", "exposures_source_sha256": "" }