{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "An assistant chooses the wrong API or sends arguments your product cannot use.",
    "change": "Apply the proposed tool-selection or argument-generation change in a sandbox.",
    "baseline": "Your current agent with the same tool schemas and task 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 completed actions, invalid calls, retries, latency, and cost per completed task.",
    "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.26891",
  "title": "Harness as a Language: A Minimalist Agent Framework With Maximal Expressivity",
  "summary": "Replaces specialized external systems such as memory frameworks (Letta/MemGPT) and self-improvement harnesses (ACE) with a single recursive code-mode LLM primitive, invoke, plus built-in constraint and monitoring hooks, eliminating manually designed tools and external memory or file systems. Costs are low in engineering complexity but shift burden to prompt design and API token spend, since all history lives as variables in a code environment; reported results run at roughly half the cost of Letta while scoring 8 points higher. Failure modes include unbounded growth of interaction history in the code environment on very long horizons, reliance on the LLM's code-generation reliability for recursive calls, and evaluation limited to two benchmarks, so gains may not transfer to other workloads.",
  "rationale": "The approach is implementable with third-party APIs and a small team and shows a measured cost and quality gain over specialized systems, but its generality is validated only on two benchmarks and requires workload-specific testing before production adoption.",
  "technique": "Recursive LLM-invoke primitive replacing agent harnesses",
  "family": "uso_de_ferramenta",
  "recommendation": "testar",
  "published": "2026-09-22",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2609.26891",
  "independent_implementations": 3,
  "total_implementations": 4,
  "stars": 35,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces specialized external systems such as memory frameworks (Letta/MemGPT) and self-improvement harnesses (ACE) with a single recursive code-mode LLM primitive, invoke, plus built-in constraint and monitoring hooks, eliminating manually designed tools and external memory or file systems. Costs are low in engineering complexity but shift burden to prompt design and API token spend, since all history lives as variables in a code environment; reported results run at roughly half the cost of Letta while scoring 8 points higher. Failure modes include unbounded growth of interaction history in the code environment on very long horizons, reliance on the LLM's code-generation reliability for recursive calls, and evaluation limited to two benchmarks, so gains may not transfer to other workloads.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.26891",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "JAZ invoke outperforms Letta (MemGPT) by 8% at half its cost on the recall-heavy portion of StuLife, and outperforms ACE by 4% at lower cost on AppWorld self-improvement.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2609.26891",
      "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": ""
}