{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OF3APLFZIEP7J6IXYR2EKWPPOD","short_pith_number":"pith:OF3APLFZ","canonical_record":{"source":{"id":"2409.13219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-20T05:12:52Z","cross_cats_sorted":[],"title_canon_sha256":"086b118576a1f7cdd71e0aa6d57c67fde79fb006d491536781b2cbfe95467249","abstract_canon_sha256":"9fc10bf20b81f7c53b1f676fde5534f34d1fb6c765e80394b74e51aebdf7e3c1"},"schema_version":"1.0"},"canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","source":{"kind":"arxiv","id":"2409.13219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13219","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13219v1","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13219","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"OF3APLFZIEP7","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"OF3APLFZIEP7J6IX","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"OF3APLFZ","created_at":"2026-07-05T09:09:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OF3APLFZIEP7J6IXYR2EKWPPOD","target":"record","payload":{"canonical_record":{"source":{"id":"2409.13219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-20T05:12:52Z","cross_cats_sorted":[],"title_canon_sha256":"086b118576a1f7cdd71e0aa6d57c67fde79fb006d491536781b2cbfe95467249","abstract_canon_sha256":"9fc10bf20b81f7c53b1f676fde5534f34d1fb6c765e80394b74e51aebdf7e3c1"},"schema_version":"1.0"},"canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:31.331236Z","signature_b64":"aIvuEEwz0y0aLWSkTt2UjvgClDMLhvLpVGsBPfAUuYDNZj3URa2XCqDr6S8JErqZqvLxiRJSIY/4InLRB4lPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","last_reissued_at":"2026-07-05T09:09:31.330774Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:31.330774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.13219","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-05T09:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eZmyvOxNL2ZyjoD/s7UPqFgPBpklIRsgABZA7efSPq9zeqeNNEkqDSp36BrjsG+wAIiGxP0Pxw51mg3E/BUcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T03:48:53.050392Z"},"content_sha256":"850e91ef22acddee538344ed974c09488b4d5495658b07a76ce82d85358c5c89","schema_version":"1.0","event_id":"sha256:850e91ef22acddee538344ed974c09488b4d5495658b07a76ce82d85358c5c89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OF3APLFZIEP7J6IXYR2EKWPPOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Eshragh, Elizabeth Stojanovski, George Dunn, Hadi Charkhgard","submitted_at":"2024-09-20T05:12:52Z","abstract_excerpt":"The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dynamic programming algorithm for solving this problem in polynomial time by sequentially adding edges inside and between each aisle to construct a tour. We provide a method where only transitions from one aisle to the next are considered, significantly reducing the number of stages in the algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13219","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/2409.13219/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-05T09:09:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7+AvhKZpyeDmctYMC7p6waqfHF5r1dxECSAowbr0X8pJJDxD9wAgrTo5+zPV1EYmY+magAPnXjSZjXIX/YyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T03:48:53.050767Z"},"content_sha256":"4bbf3b8bf28d23b884dcbe55c167cc6d7472879ecbf85183d1051f38d3f4e030","schema_version":"1.0","event_id":"sha256:4bbf3b8bf28d23b884dcbe55c167cc6d7472879ecbf85183d1051f38d3f4e030"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/bundle.json","state_url":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/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-07-10T03:48:53Z","links":{"resolver":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD","bundle":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/bundle.json","state":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OF3APLFZIEP7J6IXYR2EKWPPOD","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":"9fc10bf20b81f7c53b1f676fde5534f34d1fb6c765e80394b74e51aebdf7e3c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-20T05:12:52Z","title_canon_sha256":"086b118576a1f7cdd71e0aa6d57c67fde79fb006d491536781b2cbfe95467249"},"schema_version":"1.0","source":{"id":"2409.13219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13219","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13219v1","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13219","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_12","alias_value":"OF3APLFZIEP7","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_16","alias_value":"OF3APLFZIEP7J6IX","created_at":"2026-07-05T09:09:31Z"},{"alias_kind":"pith_short_8","alias_value":"OF3APLFZ","created_at":"2026-07-05T09:09:31Z"}],"graph_snapshots":[{"event_id":"sha256:4bbf3b8bf28d23b884dcbe55c167cc6d7472879ecbf85183d1051f38d3f4e030","target":"graph","created_at":"2026-07-05T09:09:31Z","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/2409.13219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The order picker routing problem involves finding the optimal tour of a warehouse that collects all the required items on a given pick list. Ratliff and Rosenthal introduced a dynamic programming algorithm for solving this problem in polynomial time by sequentially adding edges inside and between each aisle to construct a tour. We provide a method where only transitions from one aisle to the next are considered, significantly reducing the number of stages in the algorithm.","authors_text":"Ali Eshragh, Elizabeth Stojanovski, George Dunn, Hadi Charkhgard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-20T05:12:52Z","title":"A Modified Algorithm for Optimal Picker Routing in a Single Block Warehouse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13219","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:850e91ef22acddee538344ed974c09488b4d5495658b07a76ce82d85358c5c89","target":"record","created_at":"2026-07-05T09:09:31Z","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":"9fc10bf20b81f7c53b1f676fde5534f34d1fb6c765e80394b74e51aebdf7e3c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-09-20T05:12:52Z","title_canon_sha256":"086b118576a1f7cdd71e0aa6d57c67fde79fb006d491536781b2cbfe95467249"},"schema_version":"1.0","source":{"id":"2409.13219","kind":"arxiv","version":1}},"canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","first_computed_at":"2026-07-05T09:09:31.330774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:31.330774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aIvuEEwz0y0aLWSkTt2UjvgClDMLhvLpVGsBPfAUuYDNZj3URa2XCqDr6S8JErqZqvLxiRJSIY/4InLRB4lPAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:31.331236Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.13219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:850e91ef22acddee538344ed974c09488b4d5495658b07a76ce82d85358c5c89","sha256:4bbf3b8bf28d23b884dcbe55c167cc6d7472879ecbf85183d1051f38d3f4e030"],"state_sha256":"e3392084b69b69b1e85887e16c8f12048cdca086af326f1da6943e93c30f396a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9y39t4v84vWskuHNkmmV+bmx+1O9utk5drujVZ9tW5svCoN/L9q8UVKjaOZp6VbkQzXMtKFdUFZE0H6+ugL+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T03:48:53.052742Z","bundle_sha256":"210dc5095969f215eecee5750fcaa781bd53d85ac772a4858fde7992f7c44052"}}