Metraipolis › archive › dc_690e7dbc87f5

Replication or Corroboration? An Axiomatic Framework for Evidential Dependence in Multi-Agent Debate — arXiv:2610.36151

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.36151
License (as archived): CC0-1.0
Archived: 2026-10-28T03:01:03.624Z
SHA-256 of the archived text: dca6471588edf85f48b7b1ed47295de0f025613458918781ae61e411f97b8e23
Stable URL of this page: https://metraipolis.com/documento/dc_690e7dbc87f5

How to cite

Replication or Corroboration? An Axiomatic Framework for Evidential Dependence in Multi-Agent Debate — arXiv:2610.36151 — arXiv (en), https://arxiv.org/abs/2610.36151 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_690e7dbc87f5 (Metraipolis archive dc_690e7dbc87f5, sha256 dca6471588edf85f48b7b1ed47295de0f025613458918781ae61e411f97b8e23)

BibTeX

@misc{dc690e7dbc87f5,
  title = {Replication or Corroboration? An Axiomatic Framework for Evidential Dependence in Multi-Agent Debate — arXiv:2610.36151},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.36151},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_690e7dbc87f5; sha256 dca6471588edf85f48b7b1ed47295de0f025613458918781ae61e411f97b8e23},
  year = {2026}
}

Archived text

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

In multi-agent debates, matching reports can arise for two different reasons: agents may repeat the same evidence (replication), or they may provide separate evidential roots that support the same claim (corroboration). A judge must distinguish these two cases. Counting report occurrences gives extra weight to relays, paraphrases, alias resubmissions, and excerpt splits, while merging all matching content avoids this only by also removing genuine corroboration. We formalize this tension as a minimal judgment game in which acquiring new evidence is costly, but replication is cheap. We show that root replication invariance (RRI) is exactly threshold-uniform replication immunity. Under RRI, replication-only deviations cannot change the verdict, and positive-cost replication is strictly dominated, whereas occurrence-sensitive and content-keyed judges admit profitable deviations. We also establish an information boundary: if a judge's observation interface cannot distinguish a replica from a matched fresh root, no judge can both ignore the replica and respond strictly to the fresh root. To preserve this distinction, we introduce the lineage quotient, which removes wording, identity, occurrence multiplicity, and arbitrary root names while keeping distinct roots separate. On orbit-connected domains, it is the coarsest representation sufficient for every deterministic judge invariant to replication and root-label renaming. We further lift this construction to quantitative bipolar argumentation frameworks (QBAFs), characterize strict fresh-root response, prove its propagation along sign-consistent paths under DF-QuAD, and derive a tight closed-form response modulus. Exhaustive audits over 28,224 direct-star profiles, 2,052 multi-layer DAGs, with matched interventions on 277 AVeriTeC-derived profiles, show the predicted separation between replication and corroboration under a supplied partition.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Multiagent Systems (cs.MA) ; Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2610.36151 — 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-28T03:01:03.520Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).