{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OF3APLFZIEP7J6IXYR2EKWPPOD","short_pith_number":"pith:OF3APLFZ","schema_version":"1.0","canonical_sha256":"717607acb9411ff4f917c4744559ef70e1abab791b8a2fec40560e4bb3ca1afc","source":{"kind":"arxiv","id":"2409.13219","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.13219","created_at":"2026-07-05T09:09:31.330830+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.13219v1","created_at":"2026-07-05T09:09:31.330830+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13219","created_at":"2026-07-05T09:09:31.330830+00:00"},{"alias_kind":"pith_short_12","alias_value":"OF3APLFZIEP7","created_at":"2026-07-05T09:09:31.330830+00:00"},{"alias_kind":"pith_short_16","alias_value":"OF3APLFZIEP7J6IX","created_at":"2026-07-05T09:09:31.330830+00:00"},{"alias_kind":"pith_short_8","alias_value":"OF3APLFZ","created_at":"2026-07-05T09:09:31.330830+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD","json":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD.json","graph_json":"https://pith.science/api/pith-number/OF3APLFZIEP7J6IXYR2EKWPPOD/graph.json","events_json":"https://pith.science/api/pith-number/OF3APLFZIEP7J6IXYR2EKWPPOD/events.json","paper":"https://pith.science/paper/OF3APLFZ"},"agent_actions":{"view_html":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD","download_json":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD.json","view_paper":"https://pith.science/paper/OF3APLFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.13219&json=true","fetch_graph":"https://pith.science/api/pith-number/OF3APLFZIEP7J6IXYR2EKWPPOD/graph.json","fetch_events":"https://pith.science/api/pith-number/OF3APLFZIEP7J6IXYR2EKWPPOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/action/storage_attestation","attest_author":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/action/author_attestation","sign_citation":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/action/citation_signature","submit_replication":"https://pith.science/pith/OF3APLFZIEP7J6IXYR2EKWPPOD/action/replication_record"}},"created_at":"2026-07-05T09:09:31.330830+00:00","updated_at":"2026-07-05T09:09:31.330830+00:00"}