{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6AC6RCUIIBB33GFOH6SB3ESOLR","short_pith_number":"pith:6AC6RCUI","canonical_record":{"source":{"id":"2507.08944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-07-11T18:09:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab6bf959a415558857517a35ebcdc5c266602cc11ff3290cf8a409d19f82f316","abstract_canon_sha256":"adb6196f568fc6c3c7535d36b70a3fb168c5915d96a1ba440f7455be09186dc5"},"schema_version":"1.0"},"canonical_sha256":"f005e88a884043bd98ae3fa41d924e5c60a72cd85c4ab639ddd568ea00175e98","source":{"kind":"arxiv","id":"2507.08944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08944","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08944v1","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08944","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"6AC6RCUIIBB3","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_16","alias_value":"6AC6RCUIIBB33GFO","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_8","alias_value":"6AC6RCUI","created_at":"2026-07-05T11:36:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6AC6RCUIIBB33GFOH6SB3ESOLR","target":"record","payload":{"canonical_record":{"source":{"id":"2507.08944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-07-11T18:09:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ab6bf959a415558857517a35ebcdc5c266602cc11ff3290cf8a409d19f82f316","abstract_canon_sha256":"adb6196f568fc6c3c7535d36b70a3fb168c5915d96a1ba440f7455be09186dc5"},"schema_version":"1.0"},"canonical_sha256":"f005e88a884043bd98ae3fa41d924e5c60a72cd85c4ab639ddd568ea00175e98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:00.882606Z","signature_b64":"5bnKRBD5C73qBWGro+WSRHgQFBZkWqF+SsRZZ58/WEfWhLSFqbltivWFUNbbE5ZPgfFRuPiYSX3IcPn58QNvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f005e88a884043bd98ae3fa41d924e5c60a72cd85c4ab639ddd568ea00175e98","last_reissued_at":"2026-07-05T11:36:00.882170Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:00.882170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.08944","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-07-05T11:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFvLaWFID6gl3UYCsONc2iwAvS0IKbpF+8SnlDFCfA2tX30Rne2FiS9OhKbLG4vw6d6E3j4V5tN918IVa69aDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:51:11.024968Z"},"content_sha256":"8f31453a9fad28c605f0f8537d131c25d5d36e95193c7796e82272f385cca042","schema_version":"1.0","event_id":"sha256:8f31453a9fad28c605f0f8537d131c25d5d36e95193c7796e82272f385cca042"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6AC6RCUIIBB33GFOH6SB3ESOLR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Sequential Multi-Step Tasks with Parallel LLM Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Adam Fourney, Enhao Zhang, Erkang Zhu, Gagan Bansal, Hussein Mozannar, Jack Gerrits","submitted_at":"2025-07-11T18:09:22Z","abstract_excerpt":"Large language model (LLM)-based multi-agent systems have demonstrated remarkable promise for tackling complex tasks by breaking them down into subtasks that are iteratively planned, executed, observed, and refined. Despite their effectiveness, these systems often incur high latency because real-world problems frequently demand multiple iterative cycles of reasoning steps. To address this challenge, we propose M1-Parallel, a framework that concurrently runs multiple multi-agent teams in parallel to uncover distinct solution paths. By leveraging an event-driven communication model with asynchro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08944","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/2507.08944/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-07-05T11:36:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5HAru0Y3qe3T5juJdAlJZehzIUJYqH7dzBL9+xAR+uvynp7lI+6Yl5VhWkdOuDQIXNpJCsoNmO6rmY2A8J9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:51:11.025493Z"},"content_sha256":"50e927caf255a007cdd38e0756e774cfe88c70f4d42069c5ee81fcb2e86b8cec","schema_version":"1.0","event_id":"sha256:50e927caf255a007cdd38e0756e774cfe88c70f4d42069c5ee81fcb2e86b8cec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/bundle.json","state_url":"https://pith.science/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/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-08-07T01:51:11Z","links":{"resolver":"https://pith.science/pith/6AC6RCUIIBB33GFOH6SB3ESOLR","bundle":"https://pith.science/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/bundle.json","state":"https://pith.science/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AC6RCUIIBB33GFOH6SB3ESOLR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6AC6RCUIIBB33GFOH6SB3ESOLR","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":"adb6196f568fc6c3c7535d36b70a3fb168c5915d96a1ba440f7455be09186dc5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-07-11T18:09:22Z","title_canon_sha256":"ab6bf959a415558857517a35ebcdc5c266602cc11ff3290cf8a409d19f82f316"},"schema_version":"1.0","source":{"id":"2507.08944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.08944","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"arxiv_version","alias_value":"2507.08944v1","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.08944","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_12","alias_value":"6AC6RCUIIBB3","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_16","alias_value":"6AC6RCUIIBB33GFO","created_at":"2026-07-05T11:36:00Z"},{"alias_kind":"pith_short_8","alias_value":"6AC6RCUI","created_at":"2026-07-05T11:36:00Z"}],"graph_snapshots":[{"event_id":"sha256:50e927caf255a007cdd38e0756e774cfe88c70f4d42069c5ee81fcb2e86b8cec","target":"graph","created_at":"2026-07-05T11:36:00Z","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/2507.08944/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language model (LLM)-based multi-agent systems have demonstrated remarkable promise for tackling complex tasks by breaking them down into subtasks that are iteratively planned, executed, observed, and refined. Despite their effectiveness, these systems often incur high latency because real-world problems frequently demand multiple iterative cycles of reasoning steps. To address this challenge, we propose M1-Parallel, a framework that concurrently runs multiple multi-agent teams in parallel to uncover distinct solution paths. By leveraging an event-driven communication model with asynchro","authors_text":"Adam Fourney, Enhao Zhang, Erkang Zhu, Gagan Bansal, Hussein Mozannar, Jack Gerrits","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-07-11T18:09:22Z","title":"Optimizing Sequential Multi-Step Tasks with Parallel LLM Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.08944","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:8f31453a9fad28c605f0f8537d131c25d5d36e95193c7796e82272f385cca042","target":"record","created_at":"2026-07-05T11:36:00Z","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":"adb6196f568fc6c3c7535d36b70a3fb168c5915d96a1ba440f7455be09186dc5","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2025-07-11T18:09:22Z","title_canon_sha256":"ab6bf959a415558857517a35ebcdc5c266602cc11ff3290cf8a409d19f82f316"},"schema_version":"1.0","source":{"id":"2507.08944","kind":"arxiv","version":1}},"canonical_sha256":"f005e88a884043bd98ae3fa41d924e5c60a72cd85c4ab639ddd568ea00175e98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f005e88a884043bd98ae3fa41d924e5c60a72cd85c4ab639ddd568ea00175e98","first_computed_at":"2026-07-05T11:36:00.882170Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:00.882170Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5bnKRBD5C73qBWGro+WSRHgQFBZkWqF+SsRZZ58/WEfWhLSFqbltivWFUNbbE5ZPgfFRuPiYSX3IcPn58QNvBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:00.882606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.08944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f31453a9fad28c605f0f8537d131c25d5d36e95193c7796e82272f385cca042","sha256:50e927caf255a007cdd38e0756e774cfe88c70f4d42069c5ee81fcb2e86b8cec"],"state_sha256":"6443ec80992ca8181ca2dd668486c55fd07eb04fca79549b6751a0b932ae6885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buib2oiyjioxMlyF21GQmz0rfMpkI7WfoJZQJTgsPrJYU4sT7zk4NkxbR1UpIQd8yN2BvEMQDFXGUIN+hbk3BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:51:11.031535Z","bundle_sha256":"8c285d7929ceaa3b01644dda8f028bdb6f0e3e1b4adb9911676d46f97579e032"}}