{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KB25QA3EFXDMFNMT6VR65TXNKN","short_pith_number":"pith:KB25QA3E","schema_version":"1.0","canonical_sha256":"5075d803642dc6c2b593f563eeceed5347a8b417b8ae6f2003c2337abef51ba5","source":{"kind":"arxiv","id":"2410.02506","version":1},"attestation_state":"computed","paper":{"title":"Cut the Crap: An Economical Communication Pipeline for LLM-based Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.MA","authors_text":"Dawei Cheng, Guancheng Wan, Guibin Zhang, Jeffrey Xu Yu, Kun Wang, Sukwon Yun, Tianlong Chen, Yanwei Yue, Zhixun Li","submitted_at":"2024-10-03T14:14:31Z","abstract_excerpt":"Recent advancements in large language model (LLM)-powered agents have shown that collective intelligence can significantly outperform individual capabilities, largely attributed to the meticulously designed inter-agent communication topologies. Though impressive in performance, existing multi-agent pipelines inherently introduce substantial token overhead, as well as increased economic costs, which pose challenges for their large-scale deployments. In response to this challenge, we propose an economical, simple, and robust multi-agent communication framework, termed $\\texttt{AgentPrune}$, whic"},"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":"2410.02506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-10-03T14:14:31Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8833eaca91178ed36e3bc40bbfd7cf7518434de8d44b1c808250acab5cdafd90","abstract_canon_sha256":"77576ca7c7871ac8ee087af9da27d43ba15f43603bca26103a8f231d6d9bf629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:21.932831Z","signature_b64":"GW0NTd3HRGL0mbrBZFs01cz7wWQjymsv2GZY9PNOygTrovEPsDCeBVXVhelXylHphiyFOeFMl+Lm1/tKgMYxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5075d803642dc6c2b593f563eeceed5347a8b417b8ae6f2003c2337abef51ba5","last_reissued_at":"2026-07-05T09:15:21.932335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:21.932335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut the Crap: An Economical Communication Pipeline for LLM-based Multi-Agent Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.MA","authors_text":"Dawei Cheng, Guancheng Wan, Guibin Zhang, Jeffrey Xu Yu, Kun Wang, Sukwon Yun, Tianlong Chen, Yanwei Yue, Zhixun Li","submitted_at":"2024-10-03T14:14:31Z","abstract_excerpt":"Recent advancements in large language model (LLM)-powered agents have shown that collective intelligence can significantly outperform individual capabilities, largely attributed to the meticulously designed inter-agent communication topologies. Though impressive in performance, existing multi-agent pipelines inherently introduce substantial token overhead, as well as increased economic costs, which pose challenges for their large-scale deployments. In response to this challenge, we propose an economical, simple, and robust multi-agent communication framework, termed $\\texttt{AgentPrune}$, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.02506","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/2410.02506/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":"2410.02506","created_at":"2026-07-05T09:15:21.932391+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.02506v1","created_at":"2026-07-05T09:15:21.932391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.02506","created_at":"2026-07-05T09:15:21.932391+00:00"},{"alias_kind":"pith_short_12","alias_value":"KB25QA3EFXDM","created_at":"2026-07-05T09:15:21.932391+00:00"},{"alias_kind":"pith_short_16","alias_value":"KB25QA3EFXDMFNMT","created_at":"2026-07-05T09:15:21.932391+00:00"},{"alias_kind":"pith_short_8","alias_value":"KB25QA3E","created_at":"2026-07-05T09:15:21.932391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22385","citing_title":"MetaPS: Adaptive Programmatic Strategy Selection for Market Agents","ref_index":87,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25421","citing_title":"HyLaT: Efficient Multi-Agent Communication via Hybrid Latent-Text Protocol","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07517","citing_title":"When Identity Skews Debate: Anonymization for Bias-Reduced Multi-Agent Reasoning","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.14483","citing_title":"LEMON: Learning Executable Multi-Agent Orchestration via Counterfactual Reinforcement Learning","ref_index":9,"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":57,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06320","citing_title":"Improving the Efficiency of Language Agent Teams with Adaptive Task Graphs","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18975","citing_title":"Gated Coordination for Efficient Multi-Agent Collaboration in Minecraft Game","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18133","citing_title":"Multi-Agent Systems: From Classical Paradigms to Large Foundation Model-Enabled Futures","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02452","citing_title":"Position: How can Graphs Help Large Language Models?","ref_index":72,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN","json":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN.json","graph_json":"https://pith.science/api/pith-number/KB25QA3EFXDMFNMT6VR65TXNKN/graph.json","events_json":"https://pith.science/api/pith-number/KB25QA3EFXDMFNMT6VR65TXNKN/events.json","paper":"https://pith.science/paper/KB25QA3E"},"agent_actions":{"view_html":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN","download_json":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN.json","view_paper":"https://pith.science/paper/KB25QA3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.02506&json=true","fetch_graph":"https://pith.science/api/pith-number/KB25QA3EFXDMFNMT6VR65TXNKN/graph.json","fetch_events":"https://pith.science/api/pith-number/KB25QA3EFXDMFNMT6VR65TXNKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN/action/storage_attestation","attest_author":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN/action/author_attestation","sign_citation":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN/action/citation_signature","submit_replication":"https://pith.science/pith/KB25QA3EFXDMFNMT6VR65TXNKN/action/replication_record"}},"created_at":"2026-07-05T09:15:21.932391+00:00","updated_at":"2026-07-05T09:15:21.932391+00:00"}