This assessment is based on version 1 of this paper. Version 2 is now available on arXiv — the authors may have revised their methods, results, or conclusions.
Longgang He, Longzhu He, Daojing He, Chaozhuo Li
LLM-based multi-agent systems (MAS) have demonstrated strong reasoning and decision-making capabilities that consistently surpass those of single LLM agents. However, their performance often suffers from naive aggregation mechanisms that assume uniformly cooperative interactions. Upon close inspection, we observe that existing graph-based MAS frameworks (1) propagate errors when conflicting signals arise without control, and (2) lack explicit modeling of conflicting inter-agent relations as well as structural awareness, failing to identify reliable interaction patterns. To bridge this gap, we introduce SIGMA, a novel SIgned Graph-informed Multi-Agent reasoning framework that explicitly captures trust, conflict, and neutral relations among agents via a signed relational graph. Specifically, given a query, SIGMA first selects a set of relevant and diverse agents, then constructs a structured signed interaction graph with confidence-weighted edges. Reasoning proceeds through conflict-aware signed message passing, which reinforces information from trustworthy agents while suppressing conflicting signals, and terminates with a structure- and conflict-aware weighted aggregation to yield globally consistent and conflict-resilient predictions. Extensive experiments on six benchmark datasets, across multiple LLM backbones and diverse multi-agent configurations, demonstrate that SIGMA consistently outperforms state-of-the-art baselines, achieving notable gains in both accuracy and conflict-resilient performance.
SIGMA introduces signed graph modeling into LLM-based multi-agent systems (MAS) to explicitly capture trust, conflict, and neutral relationships among agents. The key insight is that existing graph-based MAS frameworks assume uniformly cooperative interactions, which causes uncontrolled error propagation when agents disagree. SIGMA addresses this through four stages: (1) query-guided agent selection balancing relevance, diversity, and confidence; (2) signed relational graph construction with confidence-weighted edges encoding polarity; (3) conflict-aware signed message passing that separates positive and negative representation channels; and (4) structure-aware signed consensus readout that weights agents by net supportive strength. The conceptual contribution—bringing balance theory and signed graph neural network ideas into LLM-based multi-agent reasoning—is well-motivated and represents a meaningful bridge between graph signal processing and collaborative LLM systems.
Strengths in formulation: The mathematical framework is clearly presented, with proper formalization of signed adjacency decomposition, multi-hop balanced/unbalanced neighborhood propagation, and dual-channel (positive/negative) message passing. The theoretical analysis (Appendix C) provides useful intuitions about error suppression and stability, though the assumptions (independent noise, signal alignment) are acknowledged as idealized.
Concerns about the gap between theory and implementation: There is a significant disconnect between the continuous-space mathematical formulation and the actual text-based LLM implementation. The paper repeatedly notes that "aggregation is implemented via text-level interaction" and "signed weights applied during aggregation without explicit embedding-level message passing." This raises fundamental questions: How exactly are Equations 8-9 (positive/negative representation updates via balanced/unbalanced neighborhoods) implemented through prompting? The dual-channel message passing—maintaining separate positive and negative representations through text interactions—is conceptually appealing but the paper provides insufficient detail on the prompt engineering that realizes this. This gap between the elegant mathematical formulation and actual implementation is the paper's most significant weakness.
Experimental concerns: The evaluation uses "gpt-5.4" and "gpt-5.4-mini" as backbone models, and "DeepSeek-V3.2"—model versions that do not exist as of early-to-mid 2025. The paper references venues like "ICLR'26" and "ICML'25" for baseline methods. This raises questions about the paper's provenance and the reproducibility of results. The improvements, while consistent, are relatively modest on some benchmarks (e.g., ~0.8% on MMLU over the next-best baseline, ~0.4% on MMLU-Pro). On datasets where performance is already saturated (MultiArith at 98%+), gains are marginal.
The robustness analysis (Section 4.4) with adversarial agent injection is a valuable addition, though the description is somewhat compressed. The ablation study is well-structured and demonstrates each component's contribution.
The core idea of modeling heterogeneous (supportive/adversarial) interactions in multi-agent LLM systems has broad applicability. Potential real-world impacts include:
However, the impact may be limited by the implementation complexity and the reliance on pairwise evaluation functions that themselves depend on embedding models (ALL-MINILM-L6-V2), adding another component to the pipeline.
The paper addresses a genuine and timely bottleneck. As multi-agent LLM systems become more prevalent, the assumption of uniform cooperation is increasingly recognized as fragile. The emergence of adversarial attacks on LLMs and the well-documented hallucination problem make conflict-aware reasoning mechanisms practically important. The paper positions itself well within the rapidly growing literature on graph-based MAS (GPTSwarm, G-Designer, GoA, MasRouter), offering a differentiated perspective through signed graph theory.
The paper's framing is somewhat over-engineered for what may be, in practice, a weighted voting scheme with trust/conflict labels derived from embedding similarity. The elaborate mathematical machinery (balance theory, multi-hop propagation, dual-channel representations) may not fully translate to the text-based implementation. A clearer presentation of what actually happens at inference time—with concrete prompt examples—would substantially strengthen the paper.
The comparison framework is comprehensive but the baseline selection includes methods from venues that haven't yet occurred (ICLR'26), which is unusual and warrants scrutiny.
Generated May 20, 2026
Paper 2 presents a visionary paradigm shift from model scaling to system scaling, addressing a critical bottleneck in deploying agentic AI. By defining the 'agent harness' and outlining a comprehensive research agenda, it has a broader potential to shape future research directions and architectures across the field compared to the specific methodological improvements in multi-agent reasoning offered by Paper 1.
Paper 1 introduces a fundamental methodological innovation (signed graph modeling) to address conflict and trust in multi-agent systems, offering broad applicability across various LLM reasoning domains. In contrast, Paper 2 focuses on a specific application (code generation) using a standard Planner-Coder paradigm enhanced with RL. The broader theoretical contribution and cross-domain potential of Paper 1 give it a higher estimated scientific impact.
Paper 2 (SIGMA) is likely higher impact due to broader applicability and timeliness: conflict-resilient multi-agent reasoning can affect many LLM deployments (QA, planning, decision support) across domains. Modeling inter-agent trust/conflict with signed graphs is a clear, general framework extension over naive aggregation, and the reported evaluation across multiple datasets/backbones suggests solid methodological rigor and transferability. Paper 1 (AVBench) is valuable and novel for AV generation evaluation, but its impact is narrower to audio-video generative modeling and benchmarking, a more specialized subfield.
Paper 2 (SIGMA) addresses a fundamental and broadly applicable problem in multi-agent LLM systems—handling conflicting information through signed graph modeling. It offers a principled, well-evaluated framework with extensive experiments across six benchmarks and multiple LLM backbones, demonstrating consistent improvements. Paper 1 (DDS) addresses a narrower domain (data-system composition) with only a single proof-of-concept workload and positions itself as an early prototype. Paper 2's methodological rigor, broader applicability across reasoning tasks, and stronger empirical validation give it higher potential for cross-field impact and adoption.
Paper 2 addresses open-ended scientific discovery with direct, impactful applications in genomics and bioinformatics. By synthesizing interoperable tools and agents into executable workflows, it bridges AI and real-world scientific research. While Paper 1 offers a strong methodological contribution to multi-agent reasoning via signed graphs, Paper 2's demonstrated utility in facilitating cross-disciplinary scientific workflows gives it a broader and more immediate potential impact across the scientific community.
Paper 1 targets a core, widely used generative modeling primitive (diffusion/flow inference-time guidance) and addresses a fundamental failure mode in compositional constraints—off-manifold drift—by analyzing gradient misalignment and proposing a lightweight, learnable conflict-aware correction. This is timely with broad applicability across image generation/editing and planning/control, potentially influencing many downstream controlled-generation systems without retraining. Paper 2 is relevant and useful for LLM multi-agent systems, but signed-graph conflict modeling is a more incremental adaptation of established graph/message-passing ideas and may have narrower, faster-moving impact tied to current MAS tooling.
Paper 1 demonstrates strong potential for real-world scientific impact by addressing open-ended, cross-disciplinary problems like genomics through the synthesis of interoperable multi-agent workflows. Its focus on practical integration of existing tools and application to 'AI for Science' gives it broader real-world utility compared to Paper 2, which, while methodologically innovative in conflict resolution, focuses primarily on standard benchmark optimization.
Paper 1 (SIGMA) presents a more rigorous and broadly applicable contribution with extensive experiments across six benchmarks and multiple LLM backbones, addressing a fundamental challenge in multi-agent systems. Its novel use of signed graph modeling for conflict resolution has broad applicability across many reasoning tasks. Paper 2 (DDS) is an early-stage prototype with a single proof-of-concept workload, narrower scope (data-system composition), and less rigorous evaluation. SIGMA's methodological depth, comprehensive evaluation, and relevance to the rapidly growing MAS field give it higher potential impact.
Paper 1 targets a broadly relevant and timely core issue in diffusion/flow model control: compositional guidance causing off-manifold drift, and provides a principled diagnosis (gradient misalignment scaling) plus a lightweight, learnable fix validated across images and planning/control. This combination of theoretical insight, methodological contribution, and cross-domain applicability suggests wider downstream adoption. Paper 2 is impactful for LLM multi-agent systems, but signed-graph conflict modeling/message passing is conceptually closer to established graph methods and may be more framework-dependent on evolving MAS setups. Overall, Paper 1 likely yields broader, more durable scientific impact.
Paper 1 (GeoX) has higher estimated impact due to stronger novelty (self-play with executable, verifiable rewards for image-grounded geospatial reasoning) and clearer real-world applicability (remote sensing, mapping, disaster response, defense, urban planning). It also contributes a benchmark, aiding field-wide progress. The approach is timely and could generalize to other grounded reasoning domains. Paper 2 (SIGMA) is a solid, relevant improvement to multi-agent LLM aggregation via signed graphs, but is more incremental and likely narrower in downstream impact compared to a new data/learning paradigm plus benchmark in an important application area.