Supporting Research

The science behind Context Lattice.

Independent academic research converging on the same architectural conclusions. Each paper here validates a specific Context Lattice design decision — or quantifies the cost of the alternative.

arXiv:2606.06036 Published June 4, 2026

Memory is Reconstructed, Not Retrieved: Graph Memory for LLM Agents

Shuo Ji, Yibo Li, Bryan Hooi — National University of Singapore

MRAgent introduces active memory reconstruction — a graph-based architecture that outperforms LangMem, A-Mem, Mem0, and RAG-based systems on the LoCoMo and LongMemEval benchmarks. The headline result: a 27.6× reduction in prompt tokens versus LangMem, with up to 23% higher accuracy on long-horizon tasks.

Read full paper on arXiv →
27.6×
Fewer tokens than LangMem per query
118k
Tokens / sample vs. 3.26M for LangMem
+23%
Improvement over strong baselines
Faster runtime than A-Mem

The Core Problem with Passive Retrieval

LangMem, Mem0, and conventional RAG share the same fundamental architecture: retrieve memory entries by semantic similarity to the current query, inject the results into the LLM's context window, and stop. The paper names this passive retrieval — a stateless policy that selects all memory units upfront, based solely on the query, with no adaptation during inference.

The paper documents three resulting failure modes: the retrieval strategy cannot be revised mid-reasoning; fixed similarity scores return surface-level matches that flood the context window with irrelevant noise; and static relevance functions cannot scale across unpredictable, long-horizon interactions.

Formal result

For any retrieval budget T ≥ 2, the passive hypothesis class is strictly contained in the active hypothesis class. LMs with active retrieval can learn any function that LMs with passive retrieval can — but not vice versa.

The Cognitive Neuroscience Shift

The researchers root their alternative in cognitive neuroscience, which does not model memory as passive read-out of stored content. Instead, retrieval is an active and associative reconstruction process: initiated by contextual cues, propagating through intermediate representations, progressively reconstructing coherent memory experiences from partial evidence.

This shifts the engineering question from "what is semantically similar to this query?" to "what evidence do I need to reconstruct next, given what I've accumulated so far?" The first is a lookup. The second is a reasoning loop. The paper proves the two are not equivalent — and shows which wins.

The Cue–Tag–Content Graph

MRAgent organizes memory as a heterogeneous graph. Cues are fine-grained keywords — entities, attributes, contextual keywords. Contents store the actual memory items. Tags connect them, encoding associative relations between cues and content units. Three memory layers organize the graph:

Layer 1

Episodic

Event-specific memories with temporal ordering, retrievable through fine-grained cues — entities, actions, contextual keywords.

Layer 2

Semantic

Stable knowledge: personal attributes, preferences, extracted facts. Anchored to entity-level cues via aspect-level tags.

Layer 3

Abstraction

Topic nodes summarizing recurring patterns across episodes. Enables efficient top-down traversal from topic → episode.

Memory is populated automatically. The authors designed an ingestion pipeline that uses LLMs to process raw interaction histories and populate the graph — developers orchestrate the pipeline, not the labeling.

The Reconstruction Loop

1. Cue Extraction
Extract cues from query, match against stored cue set, initialize the active candidate set.
2. LLM Reasoning & Action Selection
Conditioned on query + accumulated context, the LLM selects the next traversal action: Cue→Tag, (Cue,Tag)→Content, or reverse Content→(Cue,Tag).
3. Controlled Memory Traversal
Execute selected action to expand the candidate node set. Intermediate findings become explicit new retrieval constraints — evidence unreachable under passive policies becomes reachable here.
4. LLM Routing
Prune irrelevant candidates, update reconstructed context. Tags are evaluated before retrieval — irrelevant paths are cut before tokens are spent.
5. Termination Check
LLM evaluates whether sufficient evidence has been gathered. If yes, answer. If not, loop back to step 2. Autonomous stopping eliminates redundant data exploration entirely.

Benchmark Results

Tested on LoCoMo and LongMemEval — benchmarks that evaluate agents on long-horizon tasks spanning dozens of sessions and hundreds of dialogue turns. Backbone models: Gemini 2.5 Flash and Claude Sonnet 4.5. MRAgent outperformed every baseline across both models and all question types.

System Tokens / sample Runtime LongMemEval
MRAgentActive reconstruction 118k 586s +23% vs. baselines
A-Mem 632k 1,122s Baseline
LangMem 3,260k
Context Lattice Connection

What this means for the architecture

MRAgent's Cue–Tag–Content graph with Episodic / Semantic / Abstraction layers maps directly onto Context Lattice's P1 CanonStore / P2 LatticeMem / P3 Drop Corpus tiering. Both architectures separate exact-match structured facts (Episodic/P1) from graph-RAG associative retrieval (Semantic/P2) from unstructured vector similarity (Abstraction/P3).

The "active reconstruction" loop is the formal description of what distinguishes a real memory architecture from a glorified RAG wrapper. Context Lattice's LatticeEngine implements this — reasoning-integrated retrieval where intermediate evidence constrains the next retrieval step, rather than a one-shot vector lookup injected at context assembly time.

The 27× token efficiency delta over LangMem has direct enterprise implications. At scale, the difference between 118k and 3.26M tokens per agent interaction is not a benchmark footnote — it determines whether long-horizon agentic workflows are commercially viable at all.

arXiv:2605.05242 Published May 3, 2026

Beyond Semantic Similarity: Rethinking Retrieval for Agentic Search via Direct Corpus Interaction

Zhuofeng Li, Haoxiang Zhang, Cong Wei, et al.

DCI proposes direct corpus interaction as an alternative to conventional retrieval systems. Rather than relying on embedding models and vector indices, agents search raw corpora using general-purpose tools — substantially outperforming strong sparse, dense, and reranking baselines on the BRIGHT, BEIR, and BrowseComp-Plus benchmarks.

Read full paper on arXiv →
~60%
Relative improvement over dense retrievers on BRIGHT
3
Benchmarks validated (BRIGHT, BEIR, BrowseComp-Plus)
Direct
Corpus interaction — no pre-ranked results
Agentic
Mid-reasoning query reformulation

The Semantic Similarity Ceiling

Conventional retrieval — BM25, dense retrievers, rerankers — operates on the same assumption: pre-rank documents by similarity to the query, select the top-k, and inject them into the LLM's context window. The paper calls this a single-pass ranking paradigm: relevance is determined once, before reasoning begins, and never revisited.

This works for simple factoid queries. It fails on complex, multi-step information needs where the agent cannot know what to search for until it has seen intermediate results. The paper demonstrates that even strong reranking pipelines miss relevant documents that only become discoverable through iterative exploration.

Direct Corpus Interaction

DCI replaces passive ranking with active corpus exploration. Instead of querying a vector index, the agent interacts directly with the raw corpus using general-purpose tools — issuing searches, examining specific documents, and adapting its retrieval strategy based on what it finds mid-reasoning.

The key insight: retrieval quality depends not only on reasoning ability but also on the resolution of the interface through which the model interacts with the corpus. A high-resolution interface — one that permits reformulation, targeted document inspection, and iterative refinement — unlocks retrieval accuracy that single-pass systems cannot reach regardless of embedding quality.

Core finding

Retrieval quality depends not only on reasoning ability but also on the resolution of the interface through which the model interacts with the corpus. Agents with direct corpus access substantially outperform systems limited to pre-ranked results.

Multi-Benchmark Results

DCI was evaluated against BM25, dense retrievers, rerankers, and hybrid approaches across three benchmark families — each targeting a different retrieval difficulty level.

Benchmark Task type DCI advantage
BRIGHTComplex reasoning Knowledge-intensive, multi-hop ~60% over dense baselines
BEIR Standard IR benchmarks Consistent improvement
BrowseComp-Plus Multi-step web retrieval Complex scenario strength

Why Agents Beat Embeddings

The paper identifies three capabilities that DCI agents have and single-pass retrieval systems lack:

Capability 1

Query Reformulation

Agents reformulate queries based on discovered information — adapting the search strategy as evidence accumulates, rather than committing to a single query embedding upfront.

Capability 2

Iterative Refinement

Document selection is refined across multiple retrieval rounds. Intermediate results inform subsequent searches, enabling multi-hop reasoning chains that single-pass ranking cannot support.

Capability 3

Strategy Composition

Agents combine multiple retrieval strategies within a single reasoning chain — mixing lexical search, targeted document inspection, and cross-reference validation as needed.

Context Lattice Connection

What this means for the architecture

DCI's central finding — that retrieval quality depends on interface resolution, not just embedding quality — is a direct validation of Context Lattice's multi-tier design. The P1 CanonStore / P2 LatticeMem / P3 Drop Corpus architecture provides exactly the high-resolution interface the paper argues is necessary: structured exact-match at P1, graph-traversal at P2, and vector similarity at P3, each accessible through different interaction patterns rather than a single embedding lookup.

The paper's demonstration that agents with direct corpus access outperform systems limited to pre-ranked results mirrors the LatticeEngine's approach. Where conventional RAG systems retrieve once and inject, the LatticeEngine reasons across tiers — reformulating queries, inspecting intermediate evidence, and composing retrieval strategies mid-inference. DCI proves this is not just an engineering preference but a measurable architectural advantage.

The ~60% improvement over dense retrievers on complex reasoning tasks (BRIGHT) quantifies the cost of the single-pass retrieval paradigm that most enterprise AI memory systems still rely on. For long-horizon agentic workflows, the gap between passive ranking and active corpus interaction is the gap between a demo and a production system.