{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BLSXWZEK2G6SR7SV3HHI56ISVT","short_pith_number":"pith:BLSXWZEK","schema_version":"1.0","canonical_sha256":"0ae57b648ad1bd28fe55d9ce8ef912acde5c288e06b6a8ade6d9af1518d8eab4","source":{"kind":"arxiv","id":"2510.13903","version":2},"attestation_state":"computed","paper":{"title":"Benefits and Limitations of Communication in Multi-Agent Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Guillaume Rabusseau, Michael Hahn, Michael Rizvi-Martel, Neil Rathi, Satwik Bhattamishra","submitted_at":"2025-10-14T20:04:27Z","abstract_excerpt":"Chain-of-thought prompting has popularized step-by-step reasoning in large language models, yet model performance still degrades as problem complexity and context length grow. By decomposing difficult tasks with long contexts into shorter, manageable ones, recent multi-agent paradigms offer a promising near-term solution to this problem. However, the fundamental capacities of such systems are poorly understood. In this work, we propose a theoretical framework to analyze the expressivity of multi-agent systems. We apply our framework to three algorithmic families: state tracking, recall, and $k"},"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":"2510.13903","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2025-10-14T20:04:27Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"150356340ddfe6a92d68343bfb71910a21841f5657946d46ef3300a7b02141c3","abstract_canon_sha256":"6ab08e6dc5c29c7645a0fcec3529c230cf99b5b14451294dfeed0b9b4d009194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:21:42.745420Z","signature_b64":"jbT8IjfU6DxYAsEWH6jUj3bs1j2mLX8lpy6rc+hBvFhJ6HLBZE8ecPsrZryYmQAxLdHGPuIa3C0nYPDAbcBxAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ae57b648ad1bd28fe55d9ce8ef912acde5c288e06b6a8ade6d9af1518d8eab4","last_reissued_at":"2026-07-16T00:21:42.744424Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:21:42.744424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benefits and Limitations of Communication in Multi-Agent Reasoning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.MA","authors_text":"Guillaume Rabusseau, Michael Hahn, Michael Rizvi-Martel, Neil Rathi, Satwik Bhattamishra","submitted_at":"2025-10-14T20:04:27Z","abstract_excerpt":"Chain-of-thought prompting has popularized step-by-step reasoning in large language models, yet model performance still degrades as problem complexity and context length grow. By decomposing difficult tasks with long contexts into shorter, manageable ones, recent multi-agent paradigms offer a promising near-term solution to this problem. However, the fundamental capacities of such systems are poorly understood. In this work, we propose a theoretical framework to analyze the expressivity of multi-agent systems. We apply our framework to three algorithmic families: state tracking, recall, and $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.13903","kind":"arxiv","version":2},"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/2510.13903/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":"2510.13903","created_at":"2026-07-16T00:21:42.744895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.13903v2","created_at":"2026-07-16T00:21:42.744895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.13903","created_at":"2026-07-16T00:21:42.744895+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLSXWZEK2G6S","created_at":"2026-07-16T00:21:42.744895+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLSXWZEK2G6SR7SV","created_at":"2026-07-16T00:21:42.744895+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLSXWZEK","created_at":"2026-07-16T00:21:42.744895+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.05158","citing_title":"Streaming Communication in Multi-Agent Reasoning","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06320","citing_title":"Improving the Efficiency of Language Agent Teams with Adaptive Task Graphs","ref_index":44,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT","json":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT.json","graph_json":"https://pith.science/api/pith-number/BLSXWZEK2G6SR7SV3HHI56ISVT/graph.json","events_json":"https://pith.science/api/pith-number/BLSXWZEK2G6SR7SV3HHI56ISVT/events.json","paper":"https://pith.science/paper/BLSXWZEK"},"agent_actions":{"view_html":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT","download_json":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT.json","view_paper":"https://pith.science/paper/BLSXWZEK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.13903&json=true","fetch_graph":"https://pith.science/api/pith-number/BLSXWZEK2G6SR7SV3HHI56ISVT/graph.json","fetch_events":"https://pith.science/api/pith-number/BLSXWZEK2G6SR7SV3HHI56ISVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT/action/storage_attestation","attest_author":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT/action/author_attestation","sign_citation":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT/action/citation_signature","submit_replication":"https://pith.science/pith/BLSXWZEK2G6SR7SV3HHI56ISVT/action/replication_record"}},"created_at":"2026-07-16T00:21:42.744895+00:00","updated_at":"2026-07-16T00:21:42.744895+00:00"}