{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D7M6467WQRIYMS5VQYKZN653H7","short_pith_number":"pith:D7M6467W","schema_version":"1.0","canonical_sha256":"1fd9ee7bf68451864bb5861596fbbb3fe9162e87bab12e5a07999211883382ea","source":{"kind":"arxiv","id":"2406.11776","version":1},"attestation_state":"computed","paper":{"title":"Improving Multi-Agent Debate with Sparse Communication Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eugene Ie, Jiageng Zhang, Le Hou, Peter Grabowski, Yeqing Li, Yibing Du, Yunxuan Li","submitted_at":"2024-06-17T17:33:09Z","abstract_excerpt":"Multi-agent debate has proven effective in improving large language models quality for reasoning and factuality tasks. While various role-playing strategies in multi-agent debates have been explored, in terms of the communication among agents, existing approaches adopt a brute force algorithm -- each agent can communicate with all other agents. In this paper, we systematically investigate the effect of communication connectivity in multi-agent systems. Our experiments on GPT and Mistral models reveal that multi-agent debates leveraging sparse communication topology can achieve comparable or su"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.11776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-06-17T17:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"aaa37499beae27310b595e947996fc0392b43a12d996125cb961a3ee71a8f46f","abstract_canon_sha256":"7257dba543088fb66fac62ada273c331a2f7754a3512df5246633effe181e8f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:57.840585Z","signature_b64":"5sxd1g22z5NISeWwbZeiptiYUACxDv8f/e9yfQYBWT3mcgjSQ2X3H/6zgnWoF0PyZvQkGvHSUWpAjtIWPNbECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fd9ee7bf68451864bb5861596fbbb3fe9162e87bab12e5a07999211883382ea","last_reissued_at":"2026-07-05T08:32:57.840129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:57.840129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving Multi-Agent Debate with Sparse Communication Topology","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Eugene Ie, Jiageng Zhang, Le Hou, Peter Grabowski, Yeqing Li, Yibing Du, Yunxuan Li","submitted_at":"2024-06-17T17:33:09Z","abstract_excerpt":"Multi-agent debate has proven effective in improving large language models quality for reasoning and factuality tasks. While various role-playing strategies in multi-agent debates have been explored, in terms of the communication among agents, existing approaches adopt a brute force algorithm -- each agent can communicate with all other agents. In this paper, we systematically investigate the effect of communication connectivity in multi-agent systems. Our experiments on GPT and Mistral models reveal that multi-agent debates leveraging sparse communication topology can achieve comparable or su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11776","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.11776/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.11776","created_at":"2026-07-05T08:32:57.840178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11776v1","created_at":"2026-07-05T08:32:57.840178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11776","created_at":"2026-07-05T08:32:57.840178+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7M6467WQRIY","created_at":"2026-07-05T08:32:57.840178+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7M6467WQRIYMS5V","created_at":"2026-07-05T08:32:57.840178+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7M6467W","created_at":"2026-07-05T08:32:57.840178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27409","citing_title":"Delayed Verification Destabilizes Multi-Agent LLM Belief: Instability Thresholds and Optimal Corrector Placement","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2601.22297","citing_title":"Learning from Self-Debate: Preparing Reasoning Models for Multi-Agent Debate","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01147","citing_title":"Position: Safety and Fairness in Agentic AI Depend on Interaction Topology, Not on Model Scale or Alignment","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7","json":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7.json","graph_json":"https://pith.science/api/pith-number/D7M6467WQRIYMS5VQYKZN653H7/graph.json","events_json":"https://pith.science/api/pith-number/D7M6467WQRIYMS5VQYKZN653H7/events.json","paper":"https://pith.science/paper/D7M6467W"},"agent_actions":{"view_html":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7","download_json":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7.json","view_paper":"https://pith.science/paper/D7M6467W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11776&json=true","fetch_graph":"https://pith.science/api/pith-number/D7M6467WQRIYMS5VQYKZN653H7/graph.json","fetch_events":"https://pith.science/api/pith-number/D7M6467WQRIYMS5VQYKZN653H7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7/action/storage_attestation","attest_author":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7/action/author_attestation","sign_citation":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7/action/citation_signature","submit_replication":"https://pith.science/pith/D7M6467WQRIYMS5VQYKZN653H7/action/replication_record"}},"created_at":"2026-07-05T08:32:57.840178+00:00","updated_at":"2026-07-05T08:32:57.840178+00:00"}