Skip to content

StateTape: Action-Conditioned Evidence Lifecycle Modeling for Long-Horizon Coding Agents

Sep 2026 · arXiv.org · Vol abs/2609.36319 · 0 citations · 36 references
Computer Science

TL;DR

A novel and scalable framework that rewrites a coding agent's context as the repository changes rather than as the context grows, and can achieve a higher resolve rate in all experiments spanned by six coding agents and three edit-heavy benchmarks with little computational overhead.

Abstract

Despite the recent success of coding agents built on large language models, it remains challenging to run them over long horizons, since every observation is appended to the context and the context grows with each one. History-based maintenance is a common remedy, which masks or summarizes old observations, or prunes what a model reads as useless, and bounds the context at little cost. However, it decides from the text of the history alone and sees nothing of how the code is connected. Since a coding agent edits code many times over a single task, and each write can change what code elsewhere means, such maintenance may keep records a write has falsified, drop ones that still hold, and miss code the agent needs next. To overcome these challenges, this paper proposes StateTape, a novel and scalable framework that rewrites a coding agent's context as the repository changes rather than as the context grows. The key idea of StateTape is to model the repository as a symbol-level code graph, whose dependencies and language rules expose which symbols a write can affect. Upon this graph, a tape marks the symbols each write changed, which turns staleness from an inference about text into an observation of the agent's writes. We propose a per-write procedure in which the tape nominates the records a write could have falsified while a small manager model settles what the write log cannot, and further provide a theoretical analysis and TraceBench, a benchmark that labels what an agent is holding against what is actually needed. Empirically, we demonstrate that StateTape can effectively clear falsified records and retrieve what is needed, and thus achieve a higher resolve rate in all experiments spanned by six coding agents and three edit-heavy benchmarks with little computational overhead.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Beyond Memory: Harnessing Long-Horizon Agents with Explicit Belief States

Large language model (LLM) agents can now undertake increasingly complex tasks, but the way they organize interaction history into memory does not ensure a coherent understanding of the current world. We introduce PoS, an inference-time framework that constructs and continually maintains explicit belief states as the a...

Yu Luo, Jia-Min Jiang, Yi-Min Zuo et al. · 1 citation
#artificial intelligence Preprint Oct 2026

Stateless Language Agents: Scaling Long-Horizon Automated Research

This work introduces Stateless Language Agents (SLAs), built on the principle of stateful search with stateless agents, and evaluates SLA against three recent frameworks on software engineering, kernel optimization, and algorithm design at budgets of up to one billion tokens.

Qizheng Zhang, Chang Ji, I. Sun et al. · 2 citations

Opera: A Verbal Critic Framework for Long-horizon Coding Agents

Opera is presented, a verbal critic framework that treats each correction as a persistent note, followed until the diagnosed problem is resolved, and achieves the highest mean resolve rate among competitive critic baselines on all three benchmarks.

Kai Mei, Zhi-Yuan Hu, Yu-Tong Dai et al. · 0 citations

How Strongly Should Task State Influence an LLM Agent?

Across three models, two reasoning regimes, and two domains, four findings hold without per-turn reasoning: displaying accurate state is unreliable, an unverified ledger the agent writes itself beats an accurate checklist it is shown, directives help in proportion to the model's obedience, and enforcement needs no obed...

C. Zhang, Wonbin Kweon, Jia-Wei Han · 0 citations

Staying on Task: Testing the Foundations of Long-Horizon Agent Reliability

Long-horizon agentic workflows require models to sustain repeated state-dependent actions all while the context grows, sub-task complexity changes, and new data arrives. Each situation represents an independent axis along which an agent may fail. An agent reconciling a long ledger, for example, must repeatedly read its...

Jeffrey Willette, Krishna C. Puvvada, Boris Ginsburg · 0 citations

Related blog posts

Hugging Face Blog Nov 10, 2026

Decision Models in Hugging Face

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.