{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:WT7ONYIMSBBEUFRXURC7WLWB4M","short_pith_number":"pith:WT7ONYIM","schema_version":"1.0","canonical_sha256":"b4fee6e10c90424a1637a445fb2ec1e31b13c9e19c5f2f54bbb24d47f8eed8d2","source":{"kind":"arxiv","id":"2503.18891","version":1},"attestation_state":"computed","paper":{"title":"AgentDropout: Dynamic Agent Elimination for Token-Efficient and High-Performance LLM-Based Multi-Agent Collaboration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jie Liu, Liang Ding, Miao Zhang, Min Zhang, Xuebo Liu, Yutong Wang, Zhexuan Wang","submitted_at":"2025-03-24T17:04:55Z","abstract_excerpt":"Multi-agent systems (MAS) based on large language models (LLMs) have demonstrated significant potential in collaborative problem-solving. However, they still face substantial challenges of low communication efficiency and suboptimal task performance, making the careful design of the agents' communication topologies particularly important. Inspired by the management theory that roles in an efficient team are often dynamically adjusted, we propose AgentDropout, which identifies redundant agents and communication across different communication rounds by optimizing the adjacency matrices of the co"},"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":"2503.18891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2025-03-24T17:04:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b849240762c8223b8ad9899de755be4f5ab082ca67bbfc7ba87fd91fe5579252","abstract_canon_sha256":"768e7b85cc3fe665f8109a0f34e8d63f4b92e5fa544e819c84a06de0a0e7a882"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:38:27.854549Z","signature_b64":"AWzmx7whOTBIQazyzcpObOdbr445ruEW3ZEaU63B3InDaK0X52EU9JDBHDm6bQvV8/LewQaOGgnD1mEmrIGbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4fee6e10c90424a1637a445fb2ec1e31b13c9e19c5f2f54bbb24d47f8eed8d2","last_reissued_at":"2026-07-05T10:38:27.854040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:38:27.854040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AgentDropout: Dynamic Agent Elimination for Token-Efficient and High-Performance LLM-Based Multi-Agent Collaboration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Jie Liu, Liang Ding, Miao Zhang, Min Zhang, Xuebo Liu, Yutong Wang, Zhexuan Wang","submitted_at":"2025-03-24T17:04:55Z","abstract_excerpt":"Multi-agent systems (MAS) based on large language models (LLMs) have demonstrated significant potential in collaborative problem-solving. However, they still face substantial challenges of low communication efficiency and suboptimal task performance, making the careful design of the agents' communication topologies particularly important. Inspired by the management theory that roles in an efficient team are often dynamically adjusted, we propose AgentDropout, which identifies redundant agents and communication across different communication rounds by optimizing the adjacency matrices of the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.18891","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/2503.18891/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":"2503.18891","created_at":"2026-07-05T10:38:27.854100+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.18891v1","created_at":"2026-07-05T10:38:27.854100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.18891","created_at":"2026-07-05T10:38:27.854100+00:00"},{"alias_kind":"pith_short_12","alias_value":"WT7ONYIMSBBE","created_at":"2026-07-05T10:38:27.854100+00:00"},{"alias_kind":"pith_short_16","alias_value":"WT7ONYIMSBBEUFRX","created_at":"2026-07-05T10:38:27.854100+00:00"},{"alias_kind":"pith_short_8","alias_value":"WT7ONYIM","created_at":"2026-07-05T10:38:27.854100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09907","citing_title":"RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.26178","citing_title":"ATOM: Instantiating Budget-Controllable Multi-Agent Collaboration via Nucleus-Electron Hierarchy","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09907","citing_title":"RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation","ref_index":11,"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":90,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M","json":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M.json","graph_json":"https://pith.science/api/pith-number/WT7ONYIMSBBEUFRXURC7WLWB4M/graph.json","events_json":"https://pith.science/api/pith-number/WT7ONYIMSBBEUFRXURC7WLWB4M/events.json","paper":"https://pith.science/paper/WT7ONYIM"},"agent_actions":{"view_html":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M","download_json":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M.json","view_paper":"https://pith.science/paper/WT7ONYIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.18891&json=true","fetch_graph":"https://pith.science/api/pith-number/WT7ONYIMSBBEUFRXURC7WLWB4M/graph.json","fetch_events":"https://pith.science/api/pith-number/WT7ONYIMSBBEUFRXURC7WLWB4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M/action/storage_attestation","attest_author":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M/action/author_attestation","sign_citation":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M/action/citation_signature","submit_replication":"https://pith.science/pith/WT7ONYIMSBBEUFRXURC7WLWB4M/action/replication_record"}},"created_at":"2026-07-05T10:38:27.854100+00:00","updated_at":"2026-07-05T10:38:27.854100+00:00"}