{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "A support or data assistant repeats work across related customer requests.",
    "change": "Try the paper's memory change in a replay of past tasks, with separate memory per customer.",
    "baseline": "Your current memory pipeline plus a no-memory control using the same agent.",
    "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 success, stale memories, retrieval misses, response latency, and all memory maintenance costs.",
    "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.00675",
  "title": "LabBook: Harnessing Experimental History for Efficient LLM-Driven Discovery",
  "summary": "It replaces ancestor-selection evolutionary prompting, which either omits useful experiments or floods the context with full redundant history, with a single agent that maintains a compact LabBook memory to guide retrieval from a complete log and jointly emits the next program and a memory update. The cost is an extra memory-update step per iteration, added implementation complexity in the harness and retrieval logic, and dependence on API or backbone inference for both generation and memory maintenance. It can fail if the LabBook drifts or omits critical evidence, if retrieval from the full log misses relevant entries, or if gains measured on Frontier-CS-style discovery problems do not transfer to the reader's actual workload.",
  "rationale": "The method is implementable on constrained infrastructure since it is a prompting-and-memory harness rather than training, but the unquantified quality-cost improvement is benchmark-specific and requires validation on the reader's own tasks before production adoption.",
  "technique": "Agent-maintained LabBook memory for discovery",
  "family": "memoria_e_contexto",
  "recommendation": "testar",
  "published": "2026-09-30",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.00675",
  "independent_implementations": 0,
  "total_implementations": 0,
  "stars": 0,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "It replaces ancestor-selection evolutionary prompting, which either omits useful experiments or floods the context with full redundant history, with a single agent that maintains a compact LabBook memory to guide retrieval from a complete log and jointly emits the next program and a memory update. The cost is an extra memory-update step per iteration, added implementation complexity in the harness and retrieval logic, and dependence on API or backbone inference for both generation and memory maintenance. It can fail if the LabBook drifts or omits critical evidence, if retrieval from the full log misses relevant entries, or if gains measured on Frontier-CS-style discovery problems do not transfer to the reader's actual workload.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.00675",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "LabBook improves the observed quality-cost trade-off over evaluated evolutionary baselines on 49 Frontier-CS problems with two backbones, and remains competitive on nine additional tasks; no specific multiplicative factor is reported.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.00675",
      "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": ""
}