{
  "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.06830",
  "title": "MemPilot: Orchestrating On-Demand Multimodal Memory Curation for LLM Agents",
  "summary": "MemPilot replaces query-agnostic, preprocessing-heavy agent memory pipelines with a reinforcement-learned multi-step policy that at runtime decides whether to retrieve prebuilt memory or delegate query-specific curation of raw multimodal history to heterogeneous LLMs and VLMs, jointly controlling evidence amount, instructions, model choice, and visual access. It costs an RL training pipeline (objective-wise advantage decoupling, prefix-based marginal utility credit assignment) across five benchmarks, plus runtime policy inference and orchestration complexity that depend on access to multiple LLM/VLM endpoints. It can fail through distribution shift between training preferences and production workloads, compounding errors across multi-step curation decisions, and latency or API-cost regressions when the policy over-delegates curation to expensive models.",
  "rationale": "The core asset is a trained RL orchestration policy whose reproduction requires multi-objective RL infrastructure and benchmark-scale rollouts that exceed a constrained-budget team, so the reader should track the idea of query-adaptive memory curation rather than adopt the system now.",
  "technique": "RL-orchestrated on-demand agent memory curation",
  "family": "memoria_e_contexto",
  "recommendation": "observar",
  "published": "2026-10-05",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.06830",
  "independent_implementations": 3,
  "total_implementations": 4,
  "stars": 135,
  "citations": null,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "MemPilot replaces query-agnostic, preprocessing-heavy agent memory pipelines with a reinforcement-learned multi-step policy that at runtime decides whether to retrieve prebuilt memory or delegate query-specific curation of raw multimodal history to heterogeneous LLMs and VLMs, jointly controlling evidence amount, instructions, model choice, and visual access. It costs an RL training pipeline (objective-wise advantage decoupling, prefix-based marginal utility credit assignment) across five benchmarks, plus runtime policy inference and orchestration complexity that depend on access to multiple LLM/VLM endpoints. It can fail through distribution shift between training preferences and production workloads, compounding errors across multi-step curation decisions, and latency or API-cost regressions when the policy over-delegates curation to expensive models.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.06830",
      "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": ""
}