资讯

Replication or Corroboration? An Axiomatic Framework for Evidential Dependence in Multi-Agent Debate

📅 2026-10-28 ⏱️ 约 7 分钟阅读 ✍️ AI导航编辑部 🔗 arxiv.org
Replication or Corroboration? An Axiomatic Framework for Evidential Dependence in Multi-Agent Debate
📝 内容摘要

Computer Science > Multiagent Systems [Submitted on 26 Oct 2026] Title:Replication or Corroboration? An Axiomatic

📌 核心要点

  • Computer Science > Multiagent Systems
  • [Submitted on 26 Oct 2026]
  • From: Truong Thanh Hung Nguyen [view email][v1] Mon, 26 Oct 2026 18:53:17 UTC (92 KB)

Computer Science > Multiagent Systems

[Submitted on 26 Oct 2026]

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

View PDF HTML (experimental)Abstract: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.

Submission history

From: Truong Thanh Hung Nguyen [view email][v1] Mon, 26 Oct 2026 18:53:17 UTC (92 KB)

Additional Features

Current browse context:

cs.MA

References & Citations

Loading...

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)

Connected Papers (What is Connected Papers?)

Litmaps (What is Litmaps?)

scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub (What is DagsHub?)

Gotit.pub (What is GotitPub?)

Hugging Face (What is Huggingface?)

ScienceCast (What is ScienceCast?)

Demos

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)

CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

来源arxiv.org· 本文为编辑整理,仅供参考