{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J2BCK4FMUMPW6T24LC5P35AJJM","short_pith_number":"pith:J2BCK4FM","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"},"canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","source":{"kind":"arxiv","id":"2606.00953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00953","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00953v1","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00953","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"J2BCK4FMUMPW","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_16","alias_value":"J2BCK4FMUMPW6T24","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_8","alias_value":"J2BCK4FM","created_at":"2026-06-02T01:04:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J2BCK4FMUMPW6T24LC5P35AJJM","target":"record","payload":{"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"},"canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","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"},"source_kind":"arxiv","source_id":"2606.00953","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T01:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"joo4e/Vnyl1YSNgjgZReTr3/4X/JQlzLj6uELBnk3+4clpBSZwlM1xgqcevw1xUEnpKKcAlCOolbG7c6hmNPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:17:24.614888Z"},"content_sha256":"afeb769d0e50bb2aa7c5daadfdc6a728717313bae10367c85f0b9e4170c66770","schema_version":"1.0","event_id":"sha256:afeb769d0e50bb2aa7c5daadfdc6a728717313bae10367c85f0b9e4170c66770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J2BCK4FMUMPW6T24LC5P35AJJM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-02T01:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b6tO/P+95qF98ZvUm6phc93DmiCjtDOpSa8IPhx/ZCDc7DcFwDT08IFVtEi+VrpyXoLKi85Gwc3wX7lIVOY9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T15:17:24.615248Z"},"content_sha256":"a087ad16e459e7275c4fc8b651a2ae8e69a875009d68fc8324120af29e919702","schema_version":"1.0","event_id":"sha256:a087ad16e459e7275c4fc8b651a2ae8e69a875009d68fc8324120af29e919702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/bundle.json","state_url":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2BCK4FMUMPW6T24LC5P35AJJM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T15:17:24Z","links":{"resolver":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM","bundle":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/bundle.json","state":"https://pith.science/pith/J2BCK4FMUMPW6T24LC5P35AJJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2BCK4FMUMPW6T24LC5P35AJJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J2BCK4FMUMPW6T24LC5P35AJJM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8d6de6128fa65bec3b4cee29e963f818da6cee4ddbdabce738faa6ee8445c9b0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T02:10:12Z","title_canon_sha256":"ae8f7f2020ec579c5e5bf505ef02dfbce62937d361069de536fd6872557d384a"},"schema_version":"1.0","source":{"id":"2606.00953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00953","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00953v1","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00953","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"J2BCK4FMUMPW","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_16","alias_value":"J2BCK4FMUMPW6T24","created_at":"2026-06-02T01:04:10Z"},{"alias_kind":"pith_short_8","alias_value":"J2BCK4FM","created_at":"2026-06-02T01:04:10Z"}],"graph_snapshots":[{"event_id":"sha256:a087ad16e459e7275c4fc8b651a2ae8e69a875009d68fc8324120af29e919702","target":"graph","created_at":"2026-06-02T01:04:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.00953/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ethan Chandra, Fangru Lin, Lunyiu Nie, Stanislav Gannutin, Swarat Chaudhuri, Xu Yang","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T02:10:12Z","title":"When Parallelism Pays Off: Cohesion-Aware Task Partitioning for Multi-Agent Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00953","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:afeb769d0e50bb2aa7c5daadfdc6a728717313bae10367c85f0b9e4170c66770","target":"record","created_at":"2026-06-02T01:04:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8d6de6128fa65bec3b4cee29e963f818da6cee4ddbdabce738faa6ee8445c9b0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T02:10:12Z","title_canon_sha256":"ae8f7f2020ec579c5e5bf505ef02dfbce62937d361069de536fd6872557d384a"},"schema_version":"1.0","source":{"id":"2606.00953","kind":"arxiv","version":1}},"canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e822570aca31f6f4f5c58bafdf4094b07a29f1a2455c0fc9e87b1003aa0dbc8","first_computed_at":"2026-06-02T01:04:10.303682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:04:10.303682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nFP5cLbc0i/7b95RkAkchdENw5USGRub0X/RYsAA2hJFw+oppAivP00SkuQSfQiN+lQJG0eszI5j4tQIzYm+CQ==","signature_status":"signed_v1","signed_at":"2026-06-02T01:04:10.304306Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afeb769d0e50bb2aa7c5daadfdc6a728717313bae10367c85f0b9e4170c66770","sha256:a087ad16e459e7275c4fc8b651a2ae8e69a875009d68fc8324120af29e919702"],"state_sha256":"b32a3c51a950fa41f3a2c21992b7e0a718e999639a8616c8ec513af6a4c30cb6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IjLcJHzQ/peLFHb3VmS6cYBcb2uI92sTbgB7zzYQZlv4mJLIvmNgbyWFvebETWkg1nwmRBAJeXycG9lX7uqCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T15:17:24.617155Z","bundle_sha256":"4ccdf94b85490dcd31051389fc12e79e23a1ed7769c7b6e80b7f406f937277ef"}}