Skip to content
Preprint

Track, Rank, Crack: Epistemic Working Memory Scales Multi-Hop Reasoning in Language Agents

Jul 2026 · 0 citations · 42 references
Computer Science

TL;DR

This work introduces SLEUTH, which makes an agent's investigative state explicit and actionable through a structured epistemic working memory, and shows that how an agent organizes its reasoning, not raw model capability, is the active ingredient for scaling multi-hop reasoning.

Abstract

Language agents that interleave reasoning and tool use degrade sharply as reasoning chains lengthen, even when each individual step is easy. We trace this to context dilution: an agent's investigative state (what it has confirmed, what it suspects, and what it still needs) lives only implicitly in a growing context window, where early discoveries are buried under later retrievals. We introduce SLEUTH, which makes this state explicit and actionable through a structured epistemic working memory: the agent maintains Confirmed Facts grounded to sources, Active Hypotheses ranked by evidence, and Open Questions that directly drive its next action. Across five multi-hop benchmarks and five established baselines, SLEUTH's advantage grows with difficulty, from +5 points on HotpotQA to +11 on 4-hop chains, surpassing Reflexion without multiple episodes. Analyzing where the remaining gap lies, we identify the evidence sufficiency problem: agents often find the answer but fail to commit, exhausting their budget on needless verification. A lightweight commitment trigger fixes this, but only when the agent already maintains structured state: the identical trigger applied to an unstructured agent yields no improvement, isolating organized epistemic state as the necessary condition for effective commitment. Finally, enforcing protocol adherence on a weaker model recovers up to +19 points on the hardest problems, showing that how an agent organizes its reasoning, not raw model capability, is the active ingredient for scaling multi-hop reasoning.

View source

Similar papers

2025

Evaluating the Inductive Abilities of Large Language Models: Why Chain-of-Thought Reasoning Sometimes Hurts More Than Helps

This work presents a theoretical framework that reveals how reasoning steps can amplify error through three failure modes: incorrect sub-task decomposition, incorrect sub-task solving, and incorrect final answer summarization, and introduces structured interventions that adapt CoT generation according to the identified failure types.

Haibo Jin, Peiyan Zhang, Man Luo et al. · 1 citation
Preprint Aug 2026

Before Reasoning Can Fail: Pre-Evidence Procedural Failures in Agentic RAG

It is shown that evidence-gathering should be evaluated as a trajectory-level control problem, separately from answer-side reasoning, because larger hidden thinking budgets do not necessarily increase evidence inspection.

Daeyoung Roh, D. Han · 0 citations
Book Open access Jul 2026

Is a Busy Search Agent a Good One? Overthinking and Overretrieval at Scale

This work conducts a systematic study of overthinking and overretrieval in search agents from a scaling perspective and proposes a lightweight post-hoc reflection framework that converts the proposed evaluation signals into explicit feedback rewards to guide agents' reasoning trajectories.

Xin Liu, Ruqing Zhang, Yu-An Liu et al. · 0 citations
Preprint Jul 2026

PoTRE: Test-Time Reasoning inspired by Cognitive Heterogeneity

PoTRE (Poly-Topological Reasoning Ensembles), a heterogeneous framework that decouples inference into four agents that achieves improved reasoning performance using similar or fewer inference tokens compared to heavily scaled homogeneous baselines is introduced.

Anmol Kankariya, Sercan Ö. Arik · 0 citations
Preprint Jul 2026

RECON: Benchmarking Agent Memory for Compositional Reasoning over Long Contexts

This work introduces RECON (Reasoning over Extended Contexts with Obfuscated Narratives), a benchmark for evaluating compositional reasoning over long contexts and reveals substantial limitations across current architectures.

M. S. Arya · 0 citations
Preprint Aug 2026

Self-Correcting Long-Horizon Search Agents via Tree-Structured Memory

Large language model (LLM)-based search agents answer questions through multi-step interactions with external environments. However, providing complete execution trajectories to the LLM causes unbounded context growth and introduces noise. Existing compression methods reduce context at the cost of important details and often replace erroneous facts without repairing downstream reasoning derived from them. To address this problem, we propose ReTree, a self-correcting tree-structured memory mechanism for search agents. ReTree constructs a bounded per-step reasoning context while preserving source-linked evidence. It models search as an evidence tree whose nodes store bounded summaries, evidence, and revision histories. When newly retrieved evidence contradicts an earlier claim, ReTree traces back to the node where the claim was introduced, replaces outdated evidence, regenerates summaries, prunes affected branches, and resumes search. Source-grounded evidence provenance supports reliable conflict localization and keeps final claims traceable to retrieved passages. Experiments on four public question-answering and search benchmarks show that ReTree consistently outperforms Full-Trajectory ReAct, improving answer accuracy by up to 25.6 percentage points (pp); the average maximum per-step reasoning context of Full-Trajectory ReAct is $1.27$--$1.51\times$ that of ReTree. These results establish ReTree as an effective self-correcting memory abstraction for long-horizon search.

Aijun Yang, Qianxue Guo, Ziyi Huang et al. · 0 citations