Metraipolis › archive › dc_dc73f5409e2d

LatticeMind: A Conflict-Aware Memory Primitive for Multi-Agent Systems — arXiv:2608.08236

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08236
License (as archived)
CC0-1.0
Archived
2026-10-19T08:50:45.007Z
SHA-256 of the archived text
a9f37421b0e8ad0eab29e518005a5471ee4bc1fafead7d8e4e9b03c9fbcdd4f1
Stable URL of this page
https://metraipolis.com/documento/dc_dc73f5409e2d

How to cite

LatticeMind: A Conflict-Aware Memory Primitive for Multi-Agent Systems — arXiv:2608.08236 — arXiv (en), https://arxiv.org/abs/2608.08236 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc73f5409e2d (Metraipolis archive dc_dc73f5409e2d, sha256 a9f37421b0e8ad0eab29e518005a5471ee4bc1fafead7d8e4e9b03c9fbcdd4f1)
BibTeX
@misc{dcdc73f5409e2d,
  title = {LatticeMind: A Conflict-Aware Memory Primitive for Multi-Agent Systems — arXiv:2608.08236},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08236},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc73f5409e2d; sha256 a9f37421b0e8ad0eab29e518005a5471ee4bc1fafead7d8e4e9b03c9fbcdd4f1},
  year = {2026}
}

Archived text

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

Multi-agent LLM systems often fail not for lack of candidate answers, but because they have no persistent mechanism for deciding which incompatible claim should currently be trusted. Majority vote, debate, and judge-based selection choose an output without recording which claim wins, which is contested, or why a later update supersedes it. We present \term{LatticeMind}, a conflict-aware structured memory that handles contradiction at write time. It maintains explicit item status, applies cheap symbolic conflict checks, and invokes LLM reconciliation only for unresolved semantic cases. On a label-blind ConflictBank evaluation that removes source-name hints, LatticeMind reaches 0.97 accuracy versus 0.61 for the strongest aggregation baseline, with the gap significant at $p<10^{-6}$ by paired McNemar test. Ablations show that removing the checker or the reconciler costs 12 to 14 points. On four secondary planning benchmarks the picture is mixed: LatticeMind beats naive merge on three of four, but does not replace deliberation methods on tasks rewarding iterative search.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-11 in cs.CL).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Computation and Language (cs.CL).
Pagina del lavoro: https://arxiv.org/abs/2608.08236 — 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-19T08:49:41.975Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).