Metraipolis › archive › dc_694ef7d72ae7
The Illusion of Independent Quorums: Epistemic Fault Domains and Correlated Cognitive Failures in Agentic Quorums — arXiv:2609.02925
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02925
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T01:02:59.769Z
- SHA-256 of the archived text
44c6d893d4dbad6d795f1551082244ab564a2e2b3f6f79efbf28096498641141- Stable URL of this page
https://metraipolis.com/documento/dc_694ef7d72ae7
How to cite
The Illusion of Independent Quorums: Epistemic Fault Domains and Correlated Cognitive Failures in Agentic Quorums — arXiv:2609.02925 — arXiv (en), https://arxiv.org/abs/2609.02925 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_694ef7d72ae7 (Metraipolis archive dc_694ef7d72ae7, sha256 44c6d893d4dbad6d795f1551082244ab564a2e2b3f6f79efbf28096498641141)
BibTeX
@misc{dc694ef7d72ae7,
title = {The Illusion of Independent Quorums: Epistemic Fault Domains and Correlated Cognitive Failures in Agentic Quorums — arXiv:2609.02925},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02925},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_694ef7d72ae7; sha256 44c6d893d4dbad6d795f1551082244ab564a2e2b3f6f79efbf28096498641141},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02925. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-agent quorums are widely used to authorize high-stakes infrastructure and policy mutations, yet distinct reviewers often share upstream telemetry, documents, or tool backends. When upstream inputs fail, multiple votes collapse onto a single corrupted cause: replication does not imply epistemic redundancy. We introduce Epistemic Fault Domains (EFDs) and the Structural Epistemic Cut \kappa_E, which quantifies the minimum number of modeled root faults whose exposure covers an authorizing coalition relative to an explicit Epistemic Fault Basis. Under closed causal accounting, conservative exposure, and authorization alignment, \kappa_E lower-bounds the number of roots required for semantic compromise (\kappa_S). We prove that arbitrarily large quorums can retain \kappa_E=1, that recognizing shared ancestry never increases credited resilience, and that adding voters at a fixed threshold cannot increase the cut under compatible exposure extensions. Finally, we design the Dependency-Aware Quorum Controller (DAQC) to enforce structural cuts at runtime admission, evaluate its mechanics via analytical derivations and simulations, and provide a frozen 120-task external benchmark suite. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-04 in cs.MA). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Multiagent Systems (cs.MA); Software Engineering (cs.SE). Pagina del lavoro: https://arxiv.org/abs/2609.02925 — 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-17T00:22:10.226Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).