{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:L5VLLRVW6KZXOXENPG5OFMKFCS","short_pith_number":"pith:L5VLLRVW","canonical_record":{"source":{"id":"2605.13035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-13T05:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"75e935d969a567aadd6f66f3d4b22f4a9955c3ecb7da723293b19fc5d610b2a7","abstract_canon_sha256":"0cbc13c152c335d4266b5809aa116796c47a79a290cc80f08da77bda9f341292"},"schema_version":"1.0"},"canonical_sha256":"5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942","source":{"kind":"arxiv","id":"2605.13035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13035","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13035v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13035","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"L5VLLRVW6KZX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"L5VLLRVW6KZXOXEN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"L5VLLRVW","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:L5VLLRVW6KZXOXENPG5OFMKFCS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-13T05:42:35Z","cross_cats_sorted":[],"title_canon_sha256":"75e935d969a567aadd6f66f3d4b22f4a9955c3ecb7da723293b19fc5d610b2a7","abstract_canon_sha256":"0cbc13c152c335d4266b5809aa116796c47a79a290cc80f08da77bda9f341292"},"schema_version":"1.0"},"canonical_sha256":"5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:59.650127Z","signature_b64":"TbLjqWA9Hvyxyryh/AHnJVEtMX5kOdBnOC4CJulZ9m+rGPDajB2E9/4zETVGETU+TBjrsPbfIwnA3CKlwKpqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942","last_reissued_at":"2026-05-18T03:08:59.649598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:59.649598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13035","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-05-18T03:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtrV4T9WV2f0IWdEcZCw8swERgy6JuXA9+I82Zt4yNS+d+26Yh7vWfd5ER1s5CabDgzHL7JBmcTZEF2xO3epDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:51:22.893348Z"},"content_sha256":"fafb03e3eff95f20f2cdcea0b0a1f0afd1d609f4c296c1050160c20969ef8bce","schema_version":"1.0","event_id":"sha256:fafb03e3eff95f20f2cdcea0b0a1f0afd1d609f4c296c1050160c20969ef8bce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:L5VLLRVW6KZXOXENPG5OFMKFCS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conveyor Parcel Routing with Order-Contiguous Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Keisuke Okumura, Takuro Kato","submitted_at":"2026-05-13T05:42:35Z","abstract_excerpt":"In warehouse logistics, parcels released from the outfeed of an automated storage system must be routed through conveyor networks to workstations. Beyond collision avoidance, practical operations impose an additional requirement of order-contiguous arrivals: at each delivery point, parcels belonging to the same order must arrive as a consecutive block in the arrival sequence to reduce downstream re-sorting effort. We formalize this problem as online multi-agent path finding with order-contiguity (online MAPF-OC), where agents (i.e., parcels) appear over time and exit upon delivery. To efficien"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"DOPP is a complete polynomial-time algorithm with a three-level structure that (i) searches order-level arrival sequences, (ii) refines agent-level priorities, and (iii) synthesizes feasible solutions via prioritized planning.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the conveyor network graphs admit feasible paths under the order-contiguity constraint without requiring backtracking or violating real-time deadlines, which is assumed to hold for the tested layouts but may not generalize to all topologies.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"a07e0207b76fff356771eb9ed77d0ee96bd8225584b3038227bed0022463ca18"},"source":{"id":"2605.13035","kind":"arxiv","version":1},"verdict":{"id":"72797993-c5b1-43d5-9b74-47b2f9419225","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T02:25:48.466349Z","strongest_claim":"DOPP is a complete polynomial-time algorithm with a three-level structure that (i) searches order-level arrival sequences, (ii) refines agent-level priorities, and (iii) synthesizes feasible solutions via prioritized planning.","one_line_summary":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the conveyor network graphs admit feasible paths under the order-contiguity constraint without requiring backtracking or violating real-time deadlines, which is assumed to hold for the tested layouts but may not generalize to all topologies.","pith_extraction_headline":""},"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":"72797993-c5b1-43d5-9b74-47b2f9419225"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccn065GAStabi1ukCU+6nRK9C/gzLczIrd7xmxem3mJ/XYteOaYL6tRDr2YDoGhhwSx/CQ5pEAOuDvozEAkwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:51:22.894083Z"},"content_sha256":"8568d6e76d8f120c4e03fc4049336f7c046b410e35c4f71903e6979f73ec0c0a","schema_version":"1.0","event_id":"sha256:8568d6e76d8f120c4e03fc4049336f7c046b410e35c4f71903e6979f73ec0c0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/bundle.json","state_url":"https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/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-10T23:51:22Z","links":{"resolver":"https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS","bundle":"https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/bundle.json","state":"https://pith.science/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L5VLLRVW6KZXOXENPG5OFMKFCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:L5VLLRVW6KZXOXENPG5OFMKFCS","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":"0cbc13c152c335d4266b5809aa116796c47a79a290cc80f08da77bda9f341292","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-13T05:42:35Z","title_canon_sha256":"75e935d969a567aadd6f66f3d4b22f4a9955c3ecb7da723293b19fc5d610b2a7"},"schema_version":"1.0","source":{"id":"2605.13035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13035","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13035v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13035","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"L5VLLRVW6KZX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"L5VLLRVW6KZXOXEN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"L5VLLRVW","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:8568d6e76d8f120c4e03fc4049336f7c046b410e35c4f71903e6979f73ec0c0a","target":"graph","created_at":"2026-05-18T03:08:59Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"DOPP is a complete polynomial-time algorithm with a three-level structure that (i) searches order-level arrival sequences, (ii) refines agent-level priorities, and (iii) synthesizes feasible solutions via prioritized planning."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the conveyor network graphs admit feasible paths under the order-contiguity constraint without requiring backtracking or violating real-time deadlines, which is assumed to hold for the tested layouts but may not generalize to all topologies."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning."}],"snapshot_sha256":"a07e0207b76fff356771eb9ed77d0ee96bd8225584b3038227bed0022463ca18"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In warehouse logistics, parcels released from the outfeed of an automated storage system must be routed through conveyor networks to workstations. Beyond collision avoidance, practical operations impose an additional requirement of order-contiguous arrivals: at each delivery point, parcels belonging to the same order must arrive as a consecutive block in the arrival sequence to reduce downstream re-sorting effort. We formalize this problem as online multi-agent path finding with order-contiguity (online MAPF-OC), where agents (i.e., parcels) appear over time and exit upon delivery. To efficien","authors_text":"Keisuke Okumura, Takuro Kato","cross_cats":[],"headline":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-13T05:42:35Z","title":"Conveyor Parcel Routing with Order-Contiguous Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.13035","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T02:25:48.466349Z","id":"72797993-c5b1-43d5-9b74-47b2f9419225","model_set":{"reader":"grok-4.3"},"one_line_summary":"DOPP is a complete polynomial-time algorithm for online multi-agent path finding with order-contiguity (MAPF-OC) that plans order-level sequences, refines priorities, and synthesizes paths via prioritized planning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"DOPP is a complete polynomial-time algorithm with a three-level structure that (i) searches order-level arrival sequences, (ii) refines agent-level priorities, and (iii) synthesizes feasible solutions via prioritized planning.","weakest_assumption":"That the conveyor network graphs admit feasible paths under the order-contiguity constraint without requiring backtracking or violating real-time deadlines, which is assumed to hold for the tested layouts but may not generalize to all topologies."}},"verdict_id":"72797993-c5b1-43d5-9b74-47b2f9419225"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fafb03e3eff95f20f2cdcea0b0a1f0afd1d609f4c296c1050160c20969ef8bce","target":"record","created_at":"2026-05-18T03:08:59Z","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":"0cbc13c152c335d4266b5809aa116796c47a79a290cc80f08da77bda9f341292","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2026-05-13T05:42:35Z","title_canon_sha256":"75e935d969a567aadd6f66f3d4b22f4a9955c3ecb7da723293b19fc5d610b2a7"},"schema_version":"1.0","source":{"id":"2605.13035","kind":"arxiv","version":1}},"canonical_sha256":"5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f6ab5c6b6f2b3775c8d79bae2b14514bcf6a92a095b8bfa4b5878ad77872942","first_computed_at":"2026-05-18T03:08:59.649598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:59.649598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TbLjqWA9Hvyxyryh/AHnJVEtMX5kOdBnOC4CJulZ9m+rGPDajB2E9/4zETVGETU+TBjrsPbfIwnA3CKlwKpqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:59.650127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fafb03e3eff95f20f2cdcea0b0a1f0afd1d609f4c296c1050160c20969ef8bce","sha256:8568d6e76d8f120c4e03fc4049336f7c046b410e35c4f71903e6979f73ec0c0a"],"state_sha256":"3caa29996089b500fcf8754d150fd9a8aeeb08563d8803262d17dac8d140aba6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QB2674Xmv9hgX1A/NdBLjznygK8nQmRDr5cseRbuq7aemP+qhSWbN7Pq8igEhrDu3hfiHWMN1dxs5cZvCwJRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:51:22.898003Z","bundle_sha256":"5ddcf73bf31a1eb3e26393f3b06fe8c95a76a779a9b7ae689268cc1b41b65df6"}}