Continual Graph Memory for Mathematical Research Agents

A support or data assistant repeats work across related customer requests.

What you would change

Try the paper's memory change in a replay of past tasks, with separate memory per customer.

Try the paper's memory change in a replay of past tasks, with separate memory per customer.

Compare against

Your current memory pipeline plus a no-memory control using the same agent.

1. 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.
2. 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.
3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Task success, stale memories, retrieval misses, response latency, and all memory maintenance costs.

When to keep it

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.

recommendation

watch

research area

memory and context

technical change

Continual graph memory for agent proof search

published

2026-10-02

The demonstrated gains depend on frontier-model agent harnesses running many agents for extended periods, a cost and infrastructure profile the reader cannot support, so the technique is worth tracking rather than adopting.

1. claim 01Paperraft inference
   Read the brief interpretation

   The method replaces ad hoc transcript- or summary-based context management in long-horizon agentic search with an evolvable graph memory that stores facts, plans, and counterexamples with explicit relational edges, plus dependency-aware retrieval, an evidence-sensitive curator, and scoped recall of prior negative results. The cost is substantial engineering complexity in building and maintaining the graph memory and curator, plus the large inference budget implied by many agents running frontier models in parallel over extended periods, which is incompatible with a single 24 GB GPU or a limited API budget. Failure modes include curator errors that corrupt the research frontier or distill incorrect lessons, retrieval that surfaces stale or invalid intermediate statements, and re-proving overhead that grows with graph size; results also transfer only to domains with verifiable intermediate structure like formal mathematics.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source
2. claim 02Paperraft inference

   The paper reports closure on all ten First Proof Second Batch research tasks and autonomous solutions to the Jamison caterpillar conjecture and Erdős Problems 289, 348, and 488, but provides no quantified improvement factor against a baseline system.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source