{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5BP6GWJTUBY3JJTBYSLZ7WIFBL","short_pith_number":"pith:5BP6GWJT","canonical_record":{"source":{"id":"2506.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T09:33:13Z","cross_cats_sorted":[],"title_canon_sha256":"2a3332be8d6ad3dd5e81d5497994340f6ac22f201c19fdad4b0de474b2005a44","abstract_canon_sha256":"7b85b2e9aa5cf062c4372fe4a76ee630cf705bbde4f196d662b9f90b06e8f191"},"schema_version":"1.0"},"canonical_sha256":"e85fe35933a071b4a661c4979fd9050ae0348a1a9d5e08e242fd242f9d890789","source":{"kind":"arxiv","id":"2506.02683","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02683","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02683v1","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02683","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BP6GWJTUBY3","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_16","alias_value":"5BP6GWJTUBY3JJTB","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_8","alias_value":"5BP6GWJT","created_at":"2026-07-05T11:15:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5BP6GWJTUBY3JJTBYSLZ7WIFBL","target":"record","payload":{"canonical_record":{"source":{"id":"2506.02683","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T09:33:13Z","cross_cats_sorted":[],"title_canon_sha256":"2a3332be8d6ad3dd5e81d5497994340f6ac22f201c19fdad4b0de474b2005a44","abstract_canon_sha256":"7b85b2e9aa5cf062c4372fe4a76ee630cf705bbde4f196d662b9f90b06e8f191"},"schema_version":"1.0"},"canonical_sha256":"e85fe35933a071b4a661c4979fd9050ae0348a1a9d5e08e242fd242f9d890789","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:06.424195Z","signature_b64":"vl+znTZ/VErdFU70IwvrdNPWN3C/4KgMJbo5ibzEklS5lax5Kc2g/71aRW3dOqsweD5b4MCao9WrBPXtSMkXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e85fe35933a071b4a661c4979fd9050ae0348a1a9d5e08e242fd242f9d890789","last_reissued_at":"2026-07-05T11:15:06.423709Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:06.423709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.02683","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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6unwqu89hvZNkY2T5a5UbTlQpBQ15a2kofhSLvaJw7aTuI8Li6oFivuZXFNzaJ2eUK9nFK/ueVR15NIkCq0CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:59:01.671368Z"},"content_sha256":"92b1337000ec562c7f7e336b4617d90c57fdddc0efa007ed92c181789d683115","schema_version":"1.0","event_id":"sha256:92b1337000ec562c7f7e336b4617d90c57fdddc0efa007ed92c181789d683115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5BP6GWJTUBY3JJTBYSLZ7WIFBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decompose, Plan in Parallel, and Merge: A Novel Paradigm for Large Language Models based Planning with Multiple Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Cen Chen, Hao Peng, Huiping Zhuang, Weikai Lu, Yiling Tao, Yun Dai, Zhengdong Lu, Ziqian Zeng, Zixuan Chen","submitted_at":"2025-06-03T09:33:13Z","abstract_excerpt":"Despite significant advances in Large Language Models (LLMs), planning tasks still present challenges for LLM-based agents. Existing planning methods face two key limitations: heavy constraints and cascading errors. To address these limitations, we propose a novel parallel planning paradigm, which Decomposes, Plans for subtasks in Parallel, and Merges subplans into a final plan (DPPM). Specifically, DPPM decomposes the complex task based on constraints into subtasks, generates the subplan for each subtask in parallel, and merges them into a global plan. In addition, our approach incorporates a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02683","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/2506.02683/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:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KOx4mcw0T/rC4BTSLSHf6WeHeMnBDtV+oQJnjRkLiRKTG6cTj3qHN98q5RtJLH6WVCkuTZolwxbDvc85Bv9HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T20:59:01.671889Z"},"content_sha256":"68e841665d0103b6848801dc26b0d1cd25f65a25e7e6b47ffc6f909e799e5022","schema_version":"1.0","event_id":"sha256:68e841665d0103b6848801dc26b0d1cd25f65a25e7e6b47ffc6f909e799e5022"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/bundle.json","state_url":"https://pith.science/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/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-08T20:59:01Z","links":{"resolver":"https://pith.science/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL","bundle":"https://pith.science/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/bundle.json","state":"https://pith.science/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BP6GWJTUBY3JJTBYSLZ7WIFBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5BP6GWJTUBY3JJTBYSLZ7WIFBL","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":"7b85b2e9aa5cf062c4372fe4a76ee630cf705bbde4f196d662b9f90b06e8f191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T09:33:13Z","title_canon_sha256":"2a3332be8d6ad3dd5e81d5497994340f6ac22f201c19fdad4b0de474b2005a44"},"schema_version":"1.0","source":{"id":"2506.02683","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.02683","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"2506.02683v1","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.02683","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"5BP6GWJTUBY3","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_16","alias_value":"5BP6GWJTUBY3JJTB","created_at":"2026-07-05T11:15:06Z"},{"alias_kind":"pith_short_8","alias_value":"5BP6GWJT","created_at":"2026-07-05T11:15:06Z"}],"graph_snapshots":[{"event_id":"sha256:68e841665d0103b6848801dc26b0d1cd25f65a25e7e6b47ffc6f909e799e5022","target":"graph","created_at":"2026-07-05T11:15:06Z","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/2506.02683/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Despite significant advances in Large Language Models (LLMs), planning tasks still present challenges for LLM-based agents. Existing planning methods face two key limitations: heavy constraints and cascading errors. To address these limitations, we propose a novel parallel planning paradigm, which Decomposes, Plans for subtasks in Parallel, and Merges subplans into a final plan (DPPM). Specifically, DPPM decomposes the complex task based on constraints into subtasks, generates the subplan for each subtask in parallel, and merges them into a global plan. In addition, our approach incorporates a","authors_text":"Cen Chen, Hao Peng, Huiping Zhuang, Weikai Lu, Yiling Tao, Yun Dai, Zhengdong Lu, Ziqian Zeng, Zixuan Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T09:33:13Z","title":"Decompose, Plan in Parallel, and Merge: A Novel Paradigm for Large Language Models based Planning with Multiple Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.02683","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:92b1337000ec562c7f7e336b4617d90c57fdddc0efa007ed92c181789d683115","target":"record","created_at":"2026-07-05T11:15:06Z","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":"7b85b2e9aa5cf062c4372fe4a76ee630cf705bbde4f196d662b9f90b06e8f191","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2025-06-03T09:33:13Z","title_canon_sha256":"2a3332be8d6ad3dd5e81d5497994340f6ac22f201c19fdad4b0de474b2005a44"},"schema_version":"1.0","source":{"id":"2506.02683","kind":"arxiv","version":1}},"canonical_sha256":"e85fe35933a071b4a661c4979fd9050ae0348a1a9d5e08e242fd242f9d890789","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e85fe35933a071b4a661c4979fd9050ae0348a1a9d5e08e242fd242f9d890789","first_computed_at":"2026-07-05T11:15:06.423709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:06.423709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vl+znTZ/VErdFU70IwvrdNPWN3C/4KgMJbo5ibzEklS5lax5Kc2g/71aRW3dOqsweD5b4MCao9WrBPXtSMkXBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:06.424195Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.02683","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92b1337000ec562c7f7e336b4617d90c57fdddc0efa007ed92c181789d683115","sha256:68e841665d0103b6848801dc26b0d1cd25f65a25e7e6b47ffc6f909e799e5022"],"state_sha256":"fff583c31414239ab096dfbedf2e48285e9340776a766815e91222f7332e13fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiprwbzBzvmb2/ToqZMTzNH//I5JyrG+YRhwaKneUK81UQc/JwmTdmeasxu+B19/mJ2qe+BNckyZyH8fw3QpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T20:59:01.677137Z","bundle_sha256":"e80bd450713f2c501d96985823c241b94197e275ad9d162e9ae5d41e8807cd93"}}