{ "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": "2609.19721", "title": "LearnActCoder: Role-Aware Error Memory for Adaptive Clinical Coding Agents", "summary": "Replaces one-shot or raw-reflection prompting with a structured Mistake Knowledge Database built from a small labeled batch, routing false-negative lessons to a Coder and false-positive lessons to a Judge, all at inference time with no weight updates. Costs a labeled error-learning batch, an extra Judge pass per case (more API calls or local inference), and curation/maintenance of the memory store. Can fail through precision-recall shifts rather than net F1 gains (as on MIMIC-IV), through weak transfer of lessons across datasets or code systems, and because the evidence base is a small retrospective evaluation with low absolute CPT performance.", "rationale": "The inference-time memory pattern is cheap to replicate with a 24 GB GPU or APIs, but the only significant gain is confined to one small retrospective CPT cohort, so workload-specific validation is required before production use.", "technique": "Structured error memory for clinical coding agents", "family": "memoria_e_contexto", "recommendation": "testar", "published": "2026-09-17", "as_of": "2026-10-18", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2609.19721", "independent_implementations": 0, "total_implementations": 0, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "Replaces one-shot or raw-reflection prompting with a structured Mistake Knowledge Database built from a small labeled batch, routing false-negative lessons to a Coder and false-positive lessons to a Judge, all at inference time with no weight updates. Costs a labeled error-learning batch, an extra Judge pass per case (more API calls or local inference), and curation/maintenance of the memory store. Can fail through precision-recall shifts rather than net F1 gains (as on MIMIC-IV), through weak transfer of lessons across datasets or code systems, and because the evidence base is a small retrospective evaluation with low absolute CPT performance.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.19721", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "+5.9 percentage points CPT F1 on 150 MIMIC-III notes; ICD-9 gain not significant, MIMIC-IV F1 unchanged", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2609.19721", "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": "" }