MMODELYST
Papers/Contestable Multi-Agent Debate with Arena-based Argumentative Computation for Multimedia Verification
PAP

Contestable Multi-Agent Debate with Arena-based Argumentative Computation for Multimedia Verification

May 14, 2026

arXiv
Abstract

Multimedia verification requires not only accurate conclusions but also transparent and contestable reasoning. We propose a contestable multi-agent framework that integrates multimodal large language models, external verification tools, and arena-based quantitative bipolar argumentation (A-QBAF) as a submission to the ICMR 2026 Grand Challenge on Multimedia Verification. Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved through small local argument graphs with selective clash resolution and uncertainty-aware escalation. The resulting system generates section-wise verification reports that are transparent, editable, and computationally practical for real-world multimedia verification. Our implementation is public at: https://github.com/Analytics-Everywhere-Lab/MV2026_the_liems.

Select text to highlight · click a highlight to remove · saved in this browser only
Authors
Truong Thanh Hung Nguyen, Vo Thanh Khang Nguyen, Hoang-Loc Cao, Phuc Ho, Van Pham, Hung Cao
Your notes (browser-local)
saved
arXiv:2605.14495