{ "schema_version": 1, "builder_plan": { "scenario": "Your coding assistant makes changes that still need substantial repair before merging.", "change": "Try the technique on held-out issues from a repository with reliable tests.", "baseline": "The same coding agent, repository snapshot, tools, and token budget.", "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": "Correct patches, regression failures, human repair time, and total cost per accepted change.", "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": "2610.21073", "title": "Skip the Compressor: Coding Agents Fix More Issues When They Pick Whole Files", "summary": "The method replaces chunk-level retrieval and prompt compression with a selector that spends the entire context budget on whole files shown verbatim, requiring no compression model or training. Its cost is that selecting files rather than tokens is coarser-grained, so budget is wasted on irrelevant portions of included files and the approach presumes edited files fit within the budget. It can fail when an issue requires edits spread across more files than the budget admits, when individual files exceed the context window, or when the selector picks the wrong files, since there is no retrieval fallback.", "rationale": "File-level verbatim selection is implementable with a single API model and no trained components, and the paper reports consistent gains over both compressors and retrievers at equal token budget, which directly matches constrained-infrastructure production constraints.", "technique": "Whole-file verbatim selection for coding agents (CQ2-CARE)", "family": "agentes_de_codigo", "recommendation": "adotar", "published": "2026-10-15", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.21073", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "The method replaces chunk-level retrieval and prompt compression with a selector that spends the entire context budget on whole files shown verbatim, requiring no compression model or training. Its cost is that selecting files rather than tokens is coarser-grained, so budget is wasted on irrelevant portions of included files and the approach presumes edited files fit within the budget. It can fail when an issue requires edits spread across more files than the budget admits, when individual files exceed the context window, or when the selector picks the wrong files, since there is no retrieval fallback.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.21073", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "On 300 SWE-rebench issues at an equal per-issue token budget, CQ2-CARE resolves 43.7% (GPT-5.6) and 46.7% (Claude Opus 5) of issues, 6.3 points above the best prompt compressor and 9.3-12.7 points above the best retriever; it also exceeds trained methods SweRank by 0.7-1.7 points and SWE-Pruner by 2.0-7.3 points.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.21073", "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": "" }