{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GMH36ZCI4YT3Z3GZDW67BBUBB4","short_pith_number":"pith:GMH36ZCI","canonical_record":{"source":{"id":"1703.00699","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T10:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"e002659cde86c087444a812d50fd42acff6e72e6e9cee9d4afcecd84fa2dee8f","abstract_canon_sha256":"81e7f3ff98a58f73ae9ec3d8768786f6a7414dd4e1d81f80bac56a5cdf49172b"},"schema_version":"1.0"},"canonical_sha256":"330fbf6448e627bcecd91dbdf086810f1eac00dbbdd28aeae029c87f4955cfb2","source":{"kind":"arxiv","id":"1703.00699","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00699","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00699v3","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00699","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"pith_short_12","alias_value":"GMH36ZCI4YT3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMH36ZCI4YT3Z3GZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMH36ZCI","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GMH36ZCI4YT3Z3GZDW67BBUBB4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00699","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T10:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"e002659cde86c087444a812d50fd42acff6e72e6e9cee9d4afcecd84fa2dee8f","abstract_canon_sha256":"81e7f3ff98a58f73ae9ec3d8768786f6a7414dd4e1d81f80bac56a5cdf49172b"},"schema_version":"1.0"},"canonical_sha256":"330fbf6448e627bcecd91dbdf086810f1eac00dbbdd28aeae029c87f4955cfb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:22.752407Z","signature_b64":"i8JEZT/9efuzYh9bhvoYE5BpU2oOTwd1Roj1JaSU6Yap4/IWOBrtorlN34l5ohI5k44972pXKD/M/Ucrxn8OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330fbf6448e627bcecd91dbdf086810f1eac00dbbdd28aeae029c87f4955cfb2","last_reissued_at":"2026-05-18T00:14:22.751728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:22.751728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00699","source_version":3,"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-18T00:14:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xBnogld3iO06Up36jeNBBmOFh+qT6KsR68kqBtRuAe8/y+CNVsdvPSj3uFDAfAtR37oQ2k9MZKCjPoPynYyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:39:21.880864Z"},"content_sha256":"24c509d28e09e2753b363bd3a6b63130e33e588289e7c420d7e297685f9370b3","schema_version":"1.0","event_id":"sha256:24c509d28e09e2753b363bd3a6b63130e33e588289e7c420d7e297685f9370b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GMH36ZCI4YT3Z3GZDW67BBUBB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact algorithms for the order picking problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hadrien Cambazard, Lucie Pansart, Nicolas Catusse","submitted_at":"2017-03-02T10:26:39Z","abstract_excerpt":"Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact and effective algorithms for this problem. Firstly, a sparse formulation in mixed-integer programming is strengthened by preprocessing and valid inequalities. Secondly, a dynamic programming approach generalizing known algorithms for two or three cross-aisles is proposed and evaluated experimentally. Performances of these algorithms are reported and compared with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00699","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ADHDTHCRCAZh0UB8OVDZEJqjM9JJ30oeHAckukaZxdiJFYpIicl4eHGBO9yoWtMfDn6eGL7VpRZeM3g9cN39DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:39:21.881205Z"},"content_sha256":"d1626a29ce54953b76879317d37292e159a05a42be480c0480b8b3e1f84ada6c","schema_version":"1.0","event_id":"sha256:d1626a29ce54953b76879317d37292e159a05a42be480c0480b8b3e1f84ada6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/bundle.json","state_url":"https://pith.science/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/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-09T02:39:21Z","links":{"resolver":"https://pith.science/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4","bundle":"https://pith.science/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/bundle.json","state":"https://pith.science/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMH36ZCI4YT3Z3GZDW67BBUBB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GMH36ZCI4YT3Z3GZDW67BBUBB4","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":"81e7f3ff98a58f73ae9ec3d8768786f6a7414dd4e1d81f80bac56a5cdf49172b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T10:26:39Z","title_canon_sha256":"e002659cde86c087444a812d50fd42acff6e72e6e9cee9d4afcecd84fa2dee8f"},"schema_version":"1.0","source":{"id":"1703.00699","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00699","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00699v3","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00699","created_at":"2026-05-18T00:14:22Z"},{"alias_kind":"pith_short_12","alias_value":"GMH36ZCI4YT3","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GMH36ZCI4YT3Z3GZ","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GMH36ZCI","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:d1626a29ce54953b76879317d37292e159a05a42be480c0480b8b3e1f84ada6c","target":"graph","created_at":"2026-05-18T00:14:22Z","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"},"paper":{"abstract_excerpt":"Order picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact and effective algorithms for this problem. Firstly, a sparse formulation in mixed-integer programming is strengthened by preprocessing and valid inequalities. Secondly, a dynamic programming approach generalizing known algorithms for two or three cross-aisles is proposed and evaluated experimentally. Performances of these algorithms are reported and compared with t","authors_text":"Hadrien Cambazard, Lucie Pansart, Nicolas Catusse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T10:26:39Z","title":"Exact algorithms for the order picking problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00699","kind":"arxiv","version":3},"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:24c509d28e09e2753b363bd3a6b63130e33e588289e7c420d7e297685f9370b3","target":"record","created_at":"2026-05-18T00:14:22Z","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":"81e7f3ff98a58f73ae9ec3d8768786f6a7414dd4e1d81f80bac56a5cdf49172b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-02T10:26:39Z","title_canon_sha256":"e002659cde86c087444a812d50fd42acff6e72e6e9cee9d4afcecd84fa2dee8f"},"schema_version":"1.0","source":{"id":"1703.00699","kind":"arxiv","version":3}},"canonical_sha256":"330fbf6448e627bcecd91dbdf086810f1eac00dbbdd28aeae029c87f4955cfb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330fbf6448e627bcecd91dbdf086810f1eac00dbbdd28aeae029c87f4955cfb2","first_computed_at":"2026-05-18T00:14:22.751728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:22.751728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i8JEZT/9efuzYh9bhvoYE5BpU2oOTwd1Roj1JaSU6Yap4/IWOBrtorlN34l5ohI5k44972pXKD/M/Ucrxn8OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:22.752407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00699","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24c509d28e09e2753b363bd3a6b63130e33e588289e7c420d7e297685f9370b3","sha256:d1626a29ce54953b76879317d37292e159a05a42be480c0480b8b3e1f84ada6c"],"state_sha256":"ec640966da971e28a90d87fa708074fb242ddba7123d9e8949af7a00b4918ed7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/pbAsvwUbgTcmpN2f50dLgAkmGnWi/4SvOHcFGr9d6SCSH+M10V+kMWZsOKFtBJK+eto26nmMWkUYoCralECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:39:21.884380Z","bundle_sha256":"1ef4c1b78ebb77e2471d2fe7c2e9e1d8e07e6439f7f17a5b542b5ac804628a2a"}}