Metraipolis › archive › dc_20f502fb4f52

MoM: Memory of Memory — arXiv:2609.25054

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.25054
License (as archived)
CC0-1.0
Archived
2026-10-08T14:34:19.668Z
SHA-256 of the archived text
a6fba397e245ba9c47f6ebbd2a381d0d8c444cc83356f5b9b1e9a2f19d0844aa
Stable URL of this page
https://metraipolis.com/documento/dc_20f502fb4f52

How to cite

MoM: Memory of Memory — arXiv:2609.25054 — arXiv (en), https://arxiv.org/abs/2609.25054 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_20f502fb4f52 (Metraipolis archive dc_20f502fb4f52, sha256 a6fba397e245ba9c47f6ebbd2a381d0d8c444cc83356f5b9b1e9a2f19d0844aa)
BibTeX
@misc{dc20f502fb4f52,
  title = {MoM: Memory of Memory — arXiv:2609.25054},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.25054},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_20f502fb4f52; sha256 a6fba397e245ba9c47f6ebbd2a381d0d8c444cc83356f5b9b1e9a2f19d0844aa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25054. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a long-horizon LLM agent, the memory question is not what was once recorded but what \emph{currently holds}. Most designs answer it only indirectly: every interaction is stored, and the present is reconstructed at query time by retrieving and reconciling records, so stale values re-enter and the same conflicts are re-litigated. Committing the current value at write time avoids this, but existing write-time (CRUD) memories overwrite, so a wrong update is unrecoverable and prior state is lost. We take the missing combination---\emph{commit on arrival while retaining what is displaced}---and formalize it as \textsc{Memory of Memory} (MoM): memory tracks not only content but the provenance, status, and history of its own entries. We instantiate MoM as \textsc{Provenant Memory} (P-Mem), a typed provenance graph whose \emph{active frontier} exposes one current value per resolved key while displaced values are retained as provenance; typed operations decide whether a new observation supports, supersedes, contests, rejects, revokes, or resolves an existing value. P-Mem's decisive gain is validity rather than accuracy: its turn-level read matches the strongest retrieval memory in accuracy at $\sim$4$\times$ fewer read tokens---a retrieval-granularity effect---while graph-guided turn pruning cuts the knowledge-update stale-answer rate (19.4\%$\rightarrow$10.9\%); on revision chains it stays at 100\% where query-time reading collapses to 25\%, and, because displaced values are retained rather than overwritten, it recovers committed errors a CRUD memory cannot (100\% vs.\ 0\%).

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-23 in cs.CL).
Categorie arXiv: Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2609.25054 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:46:15.654Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).