{ "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.29326", "title": "Signals and Queries: Token-Efficient Agentic Context Discovery", "summary": "S&Q replaces per-turn LLM-based relevance evaluation of every behavioral policy with an offline-trained, per-policy logistic classifier over embeddings that filters candidates before any LLM call. The cost is an offline generation step (activating examples and hard negatives per policy), classifier training and maintenance per policy, and a small risk of false negatives that downstream stages never see. It can fail when user behavior drifts from the offline training examples, when new policies lack sufficient generated examples, or when embedding quality is poor for the domain, since a wrongly discarded policy is silently excluded from that turn.", "rationale": "The method requires only embedding APIs and a logistic classifier, fits a 24 GB GPU or API-only setup with no per-turn LLM cost, and directly reduces production token spend, so it is adoptable now provided recall is validated on the reader's own policy set.", "technique": "Per-policy embedding classifier as pre-filter for agent policies", "family": "memoria_e_contexto", "recommendation": "adotar", "published": "2026-10-21", "as_of": "2026-10-25", "editorial_status": "indexed", "source_url": "https://arxiv.org/abs/2610.29326", "independent_implementations": 2, "total_implementations": 2, "stars": 0, "citations": 0, "claims": [ { "claim_id": "claim-01", "statement": "S&Q replaces per-turn LLM-based relevance evaluation of every behavioral policy with an offline-trained, per-policy logistic classifier over embeddings that filters candidates before any LLM call. The cost is an offline generation step (activating examples and hard negatives per policy), classifier training and maintenance per policy, and a small risk of false negatives that downstream stages never see. It can fail when user behavior drifts from the offline training examples, when new policies lack sufficient generated examples, or when embedding quality is poor for the domain, since a wrongly discarded policy is silently excluded from that turn.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.29326", "source_page": null, "source_excerpt": "" }, { "claim_id": "claim-02", "statement": "Removes at least 30% of candidate policies before downstream LLM evaluation while preserving high recall, with higher precision than top-K and cosine-threshold retrieval at every evaluated recall level.", "basis": "inferred", "result": "", "baseline": "", "conditions": "", "source_url": "https://arxiv.org/abs/2610.29326", "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": "" }