{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J2BCK4FMUMPW6T24LC5P35AJJM","short_pith_number":"pith:J2BCK4FM","schema_version":"1.0","canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","source":{"kind":"arxiv","id":"2606.00953","version":1},"attestation_state":"computed","paper":{"title":"When Parallelism Pays Off: Cohesion-Aware Task Partitioning for Multi-Agent Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LG","authors_text":"Ethan Chandra, Fangru Lin, Lunyiu Nie, Stanislav Gannutin, Swarat Chaudhuri, Xu Yang","submitted_at":"2026-05-31T02:10:12Z","abstract_excerpt":"Multi-agent Large Language Model (LLM) systems offer a way to decompose complex tasks, such as coding, through parallelization and context isolation. However, adding agents in practice introduces inter-agent communication overhead, which incurs extra cost and can sometimes offset the efficiency gains. We formalize multi-agent orchestration as a graph partitioning problem that captures the communication-to-computation trade-off: task decomposition can shorten critical-path computation, but cross-agent dependencies require costly context transfer. We instantiate this view in repository-level sof"},"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":"2606.00953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T02:10:12Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"ae8f7f2020ec579c5e5bf505ef02dfbce62937d361069de536fd6872557d384a","abstract_canon_sha256":"8d6de6128fa65bec3b4cee29e963f818da6cee4ddbdabce738faa6ee8445c9b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:10.304306Z","signature_b64":"nFP5cLbc0i/7b95RkAkchdENw5USGRub0X/RYsAA2hJFw+oppAivP00SkuQSfQiN+lQJG0eszI5j4tQIzYm+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","last_reissued_at":"2026-06-02T01:04:10.303682Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:10.303682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"When Parallelism Pays Off: Cohesion-Aware Task Partitioning for Multi-Agent Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LG","authors_text":"Ethan Chandra, Fangru Lin, Lunyiu Nie, Stanislav Gannutin, Swarat Chaudhuri, Xu Yang","submitted_at":"2026-05-31T02:10:12Z","abstract_excerpt":"Multi-agent Large Language Model (LLM) systems offer a way to decompose complex tasks, such as coding, through parallelization and context isolation. However, adding agents in practice introduces inter-agent communication overhead, which incurs extra cost and can sometimes offset the efficiency gains. We formalize multi-agent orchestration as a graph partitioning problem that captures the communication-to-computation trade-off: task decomposition can shorten critical-path computation, but cross-agent dependencies require costly context transfer. We instantiate this view in repository-level sof"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00953","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/2606.00953/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":"2606.00953","created_at":"2026-06-02T01:04:10.303780+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00953v1","created_at":"2026-06-02T01:04:10.303780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00953","created_at":"2026-06-02T01:04:10.303780+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2BCK4FMUMPW","created_at":"2026-06-02T01:04:10.303780+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2BCK4FMUMPW6T24","created_at":"2026-06-02T01:04:10.303780+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2BCK4FM","created_at":"2026-06-02T01:04:10.303780+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM","json":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM.json","graph_json":"https://pith.science/api/pith-number/J2BCK4FMUMPW6T24LC5P35AJJM/graph.json","events_json":"https://pith.science/api/pith-number/J2BCK4FMUMPW6T24LC5P35AJJM/events.json","paper":"https://pith.science/paper/J2BCK4FM"},"agent_actions":{"view_html":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM","download_json":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM.json","view_paper":"https://pith.science/paper/J2BCK4FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00953&json=true","fetch_graph":"https://pith.science/api/pith-number/J2BCK4FMUMPW6T24LC5P35AJJM/graph.json","fetch_events":"https://pith.science/api/pith-number/J2BCK4FMUMPW6T24LC5P35AJJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/action/storage_attestation","attest_author":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/action/author_attestation","sign_citation":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/action/citation_signature","submit_replication":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/action/replication_record"}},"created_at":"2026-06-02T01:04:10.303780+00:00","updated_at":"2026-06-02T01:04:10.303780+00:00"}