Compute Globally, Materialize Locally: The Memory Contract of Sparse Event-KV
Abstract
Long-horizon agents increasingly reuse their KV cache as memory: a serving system keeps a subset of cached entries and drops the rest. Eviction and episodic-memory schemes therefore rest on a premise rarely tested directly, that a retained event is still informative once the observations that produced it are gone. We test it by omitting one earlier observation from what is served, across otherwise identical agent histories. Among items sensitive to that observation, the answer overwhelmingly follows the omitted value, though no served span says which value is correct. We call this semantic materialization: a downstream event's cached rows act as an independently servable view of computation whose inputs are gone. It can also be written on purpose. A deliberately phrased, answer-free event raises donor-aligned recovery from 6% to 51% on Qwen3-8B without ever naming the value, whereas passively harvesting natural mentions from long-term dialog yields no detected advantage. What such a row carries is specific and bounded. Compact state survives, larger payloads decay toward chance, and whether a construction writes at all turns on phrasing rather than on meaning alone, so two phrasings the model comprehends equally well can diverge sharply. The result is a memory contract for sparse event-KV serving: what to write, where it lands, and what survives once the source is gone. For anyone who evicts the corollary is that dropping a source event and observing no accuracy loss does not show the source was unnecessary.
Community
What can a retained KV row remember after its source event has been evicted?
We test this with donor pairs: two histories have identical served tokens and positions and differ only in an omitted source value. On Qwen3-8B, donor-sensitive outputs follow that hidden donor 99:0, although no served text states the value. We call this semantic materialization.
We then map its memory contract:
- Trigger: write-through depends on phrasing, not meaning alone.
- Landing: the root event carries the strongest signal; later reference edges mostly route back to it.
- Access: compact state survives, while larger payloads fade toward chance.
- Programming: an answer-free carrier raises donor-aligned recovery from 6% to 51% without ever naming the value.
The practical implication is simple: removing a source event without hurting accuracy does not prove it was unnecessary—a retained row may already carry its result.
Code and full reproduction instructions are available in the repository. Feedback from researchers working on KV-cache reuse, eviction, and long-horizon agent memory is very welcome.
This is an automated message from the Librarian Bot. I found the following papers similar to this paper.
The following papers were recommended by the Semantic Scholar API
- Models Take Notes at Prefill: KV Cache Can Be Editable and Composable (2026)
- Understanding Is Done Early: A Depth Division of Labor in Large Language Models and Its Use for Unbounded-Context Memory (2026)
- What to Keep, What to Forget: A Rate--Distortion View of Memory Compaction in LLMs and Agents (2026)
- Subtract or Replay? Exact Deletion from Language-Model Memory (2026)
- Memory-Managed Long-Context Attention: Bounded Editable Memory with a Hard Lifecycle and Calibrated Sparse Fallback (2026)
- Reclaim Evaluation: A Lossy Memory Is Worse Than an Empty One (2026)
- Persistent Computational State: A Session-Centric Runtime for Generative World Models (2026)
Please give a thumbs up to this comment if you found it helpful!
If you want recommendations for any Paper on Hugging Face checkout this Space
You can directly ask Librarian Bot for paper recommendations by tagging it in a comment: @librarian-bot recommend
Get this paper in your agent:
hf papers read 2607.23693 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper