Metraipolis › archive › dc_574118a561ea
Incident Memory: Training-Free Operational Memory through Sequential Pattern Mining and Velocity-Stratified Retrieval — arXiv:2609.01616
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01616
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:46:39.716Z
- SHA-256 of the archived text
0f7aa48da21d3569af70d9ccf9bd88d65da4dace0c9f3b4080c3df729306f776- Stable URL of this page
https://metraipolis.com/documento/dc_574118a561ea
How to cite
Incident Memory: Training-Free Operational Memory through Sequential Pattern Mining and Velocity-Stratified Retrieval — arXiv:2609.01616 — arXiv (en), https://arxiv.org/abs/2609.01616 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_574118a561ea (Metraipolis archive dc_574118a561ea, sha256 0f7aa48da21d3569af70d9ccf9bd88d65da4dace0c9f3b4080c3df729306f776)
BibTeX
@misc{dc574118a561ea,
title = {Incident Memory: Training-Free Operational Memory through Sequential Pattern Mining and Velocity-Stratified Retrieval — arXiv:2609.01616},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01616},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_574118a561ea; sha256 0f7aa48da21d3569af70d9ccf9bd88d65da4dace0c9f3b4080c3df729306f776},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01616. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Incident response is a memory problem: teams accumulate tickets, traces, postmortems, and wiki pages, but the knowledge needed for the next incident is rarely stored with its order, freshness, and provenance intact. We present Incident Memory, a deterministic system that accumulates operational knowledge without model training. It combines (i) velocity-stratified retrieval, which ages structural, behavioral, contextual, and ephemeral facts at different rates; (ii) fingerprint-conditioned PrefixSpan mining, which extracts ordered playbooks from successful investigations; and (iii) provenance-aware metric definitions, which detect conflicting definitions through executable checks. On the UCI ITSM event log, containing 141,712 events across 24,918 incidents, Incident Memory extracts 23,110 ordered traces, mines 39 playbooks, and covers 84.3% of 6,934 held-out incidents. On controlled benchmarks with known ground truth, it achieves 99.2% ordered playbook precision (controlled), an architectural staleness guarantee versus 36% stale returns for a flat baseline, and conflict-detection F1 of 0.876. A direct Claude Haiku baseline on 19 fingerprint groups reaches 0.661 ordered precision, compared with 0.985 for PrefixSpan. The central result is not that language models are weak at incident response; it is that repeated incident histories are low-entropy once conditioned on fingerprint and previous action. In that regime, exact memory is a stronger primitive than open-ended generation. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-03 in cs.IR). Categorie arXiv: Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2609.01616 — 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-17T05:23:20.814Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).