{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IDIBSDMAT3IOMAK7LS3TPL3IZF","short_pith_number":"pith:IDIBSDMA","schema_version":"1.0","canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","source":{"kind":"arxiv","id":"2506.02951","version":3},"attestation_state":"computed","paper":{"title":"Adaptive Graph Pruning for Multi-Agent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.CL","authors_text":"Boyi Li, Der-Horng Lee, Gaoang Wang, Zhonghan Zhao","submitted_at":"2025-06-03T14:46:00Z","abstract_excerpt":"Large Language Model (LLM) based multi-agent systems have shown remarkable performance in various tasks, especially when enhanced through collaborative communication. However, current methods often rely on a fixed number of agents and static communication structures, limiting their ability to adapt to varying task complexities. In this paper, we propose Adaptive Graph Pruning (AGP), a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity (hard-pruning) and communication topology (soft-pruning). Specifically, our method employs a two-stage training strate"},"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":"2506.02951","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T14:46:00Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"15a79ded30a2cc797d0bf2446caec6f1f696c2cf7320c6e393d58a4e0feb9470","abstract_canon_sha256":"c3e247522aab8e50536b9e50e9d080cce2ed82985e4c852d404fc2bb5cd6cce4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:42.674364Z","signature_b64":"y7riHuW7LiMH0T/T3c4iyqew2tZVu0A7F1YqNFgPQc9iHmsQoj4XyUrpQ9tUXOav8nC70SFbHOxdESfjfbcZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d0190d809ed0e6015f5cb737af68c957d5e404e33ba0c01085f055a8f679af","last_reissued_at":"2026-07-05T11:41:42.673878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:42.673878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Graph Pruning for Multi-Agent Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.CL","authors_text":"Boyi Li, Der-Horng Lee, Gaoang Wang, Zhonghan Zhao","submitted_at":"2025-06-03T14:46:00Z","abstract_excerpt":"Large Language Model (LLM) based multi-agent systems have shown remarkable performance in various tasks, especially when enhanced through collaborative communication. However, current methods often rely on a fixed number of agents and static communication structures, limiting their ability to adapt to varying task complexities. In this paper, we propose Adaptive Graph Pruning (AGP), a novel task-adaptive multi-agent collaboration framework that jointly optimizes agent quantity (hard-pruning) and communication topology (soft-pruning). Specifically, our method employs a two-stage training strate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02951","kind":"arxiv","version":3},"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/2506.02951/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":"2506.02951","created_at":"2026-07-05T11:41:42.673936+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.02951v3","created_at":"2026-07-05T11:41:42.673936+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02951","created_at":"2026-07-05T11:41:42.673936+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDIBSDMAT3IO","created_at":"2026-07-05T11:41:42.673936+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDIBSDMAT3IOMAK7","created_at":"2026-07-05T11:41:42.673936+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDIBSDMA","created_at":"2026-07-05T11:41:42.673936+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20621","citing_title":"PEAR: Permutation-Equivariant Adaptive Routing Multi-Agent Debate","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00765","citing_title":"FALAT: Tracing Failures in LLM Agent Trajectories via Dependency-Guided Search","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17361","citing_title":"MasFACT: Continual Multi-Agent Topology Learning via Geometry-Aware Posterior Transfer","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2511.20857","citing_title":"Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16543","citing_title":"Conjunctive Prompt Attacks in Multi-Agent LLM Systems","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF","json":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF.json","graph_json":"https://pith.science/api/pith-number/IDIBSDMAT3IOMAK7LS3TPL3IZF/graph.json","events_json":"https://pith.science/api/pith-number/IDIBSDMAT3IOMAK7LS3TPL3IZF/events.json","paper":"https://pith.science/paper/IDIBSDMA"},"agent_actions":{"view_html":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF","download_json":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF.json","view_paper":"https://pith.science/paper/IDIBSDMA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.02951&json=true","fetch_graph":"https://pith.science/api/pith-number/IDIBSDMAT3IOMAK7LS3TPL3IZF/graph.json","fetch_events":"https://pith.science/api/pith-number/IDIBSDMAT3IOMAK7LS3TPL3IZF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/action/storage_attestation","attest_author":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/action/author_attestation","sign_citation":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/action/citation_signature","submit_replication":"https://pith.science/pith/IDIBSDMAT3IOMAK7LS3TPL3IZF/action/replication_record"}},"created_at":"2026-07-05T11:41:42.673936+00:00","updated_at":"2026-07-05T11:41:42.673936+00:00"}