arXiv Computation and Language By Kazuki Nakayashiki

When Stale Constraints Go Unchecked: Budgeted Verification Failures in Inherited Agent Memory

Read the original on arXiv Computation and Language →

The paper investigates how agents that inherit consolidated memory can mistakenly rely on constraints that were once true but have since been superseded by newer records. By modeling supersession explicitly and limiting verification to two records, the study shows that native allocation often leads to stale-consistent decisions, while reallocating one verification slot to the critical provenance path markedly improves consistency. The results suggest that memory systems may need separate freshness or supersession signals beyond relevance to avoid such errors.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 24

Temporal Validity on Real Software Histories: Eliminating Stale-Fact Errors in Code-Assistant Memory over GitHub Fixes

The paper evaluates a deterministic supersession memory, MemStrata, for retrieval‑augmented generation (RAG) systems on real software history. Using 707 GitHub issues, the authors extracted 130 clean atomic state transitions where a single value changes from pre‑fix to post‑fix. MemStrata achieved 0.91 answer accuracy versus 0.57–0.59 for standard RAG, eliminating stale‑fact errors that RAG returned 36–38% of the time, while maintaining comparable retrieval latency.

By Neeraj Yadav