{
  "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": "2609.28919",
  "title": "Control the Harness, Control the Cost: Routing and Governing AI Coding Agents in the Enterprise",
  "summary": "The method replaces default vendor harness behavior, in which one proprietary harness fixes the model, cache usage, and subagent choices for every request, with a calibrated classifier (Jev) that routes sessions at cache-safe switch points: session start, side lanes, and subagent launches. It costs the effort of building and maintaining a bring-your-own prompt taxonomy, training the classifier, and operating a control plane, plus the risk of paying cache-rebuild costs when mid-task switches do not pay back. It can fail if the enterprise's workload is small enough that routing savings are below engineering cost, if price sheets or vendor APIs change, or if misclassification routes work to a model whose quality loss exceeds the savings.",
  "rationale": "Routing at session boundaries is implementable with API access and no cluster, but the claimed 14-21% savings are validated at 10,000-seat scale, so a small team must confirm on its own usage that savings exceed the cost of building the taxonomy and classifier.",
  "technique": "Cost-aware routing of coding-agent sessions across models",
  "family": "agentes_de_codigo",
  "recommendation": "testar",
  "published": "2026-09-24",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2609.28919",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "The method replaces default vendor harness behavior, in which one proprietary harness fixes the model, cache usage, and subagent choices for every request, with a calibrated classifier (Jev) that routes sessions at cache-safe switch points: session start, side lanes, and subagent launches. It costs the effort of building and maintaining a bring-your-own prompt taxonomy, training the classifier, and operating a control plane, plus the risk of paying cache-rebuild costs when mid-task switches do not pay back. It can fail if the enterprise's workload is small enough that routing savings are below engineering cost, if price sheets or vendor APIs change, or if misclassification routes work to a model whose quality loss exceeds the savings.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.28919",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Router recovers 14-21% of model spend ($3.3M-$5.0M/year) in an emulated 10,000-seat enterprise; on long tool-heavy sessions the highest-priced model can cost less than the next tier due to cache effects.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.28919",
      "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": ""
}