{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:P6B3PBKX6FFLA526N2DW7WSUQW","short_pith_number":"pith:P6B3PBKX","canonical_record":{"source":{"id":"2405.15464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-24T11:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"c1f4b4d4784a8db4846ba32af13ee80862e651ba2b4bbe8d8f346dacace66c3e","abstract_canon_sha256":"32670504cf9278c87d053e55e36ad7944640077f59f8e7b12d3d59a44c7fad62"},"schema_version":"1.0"},"canonical_sha256":"7f83b78557f14ab0775e6e876fda5485867e6ecfaceeabb18ed21933d087f75e","source":{"kind":"arxiv","id":"2405.15464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.15464","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"2405.15464v1","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15464","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"P6B3PBKX6FFL","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_16","alias_value":"P6B3PBKX6FFLA526","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_8","alias_value":"P6B3PBKX","created_at":"2026-07-05T08:22:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:P6B3PBKX6FFLA526N2DW7WSUQW","target":"record","payload":{"canonical_record":{"source":{"id":"2405.15464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-24T11:39:09Z","cross_cats_sorted":[],"title_canon_sha256":"c1f4b4d4784a8db4846ba32af13ee80862e651ba2b4bbe8d8f346dacace66c3e","abstract_canon_sha256":"32670504cf9278c87d053e55e36ad7944640077f59f8e7b12d3d59a44c7fad62"},"schema_version":"1.0"},"canonical_sha256":"7f83b78557f14ab0775e6e876fda5485867e6ecfaceeabb18ed21933d087f75e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:50.032255Z","signature_b64":"sx06gDuiNplvJh84B9fPwDsYDKrj2nB0FQoAXF6WUSiJuf2LxzQBpF0hTEvSU4atTfEsJA0DUoaiQ5+zoHizBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f83b78557f14ab0775e6e876fda5485867e6ecfaceeabb18ed21933d087f75e","last_reissued_at":"2026-07-05T08:22:50.031783Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:50.031783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.15464","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-05T08:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ReIxhcvEnJGl7ucgUm5R9xCVE2hR2nXh4jLbItpRIIjSloM7OFBCEQOPndSOBKLrWyjVctxNbaG/0vKSqIVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:41:59.477385Z"},"content_sha256":"9a6512153cd642c247b653ac143262ecbd223f6e02c75a44c6eb4523a3da0bad","schema_version":"1.0","event_id":"sha256:9a6512153cd642c247b653ac143262ecbd223f6e02c75a44c6eb4523a3da0bad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:P6B3PBKX6FFLA526N2DW7WSUQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hadrien Cambazard (G-SCOP), Nicolas Catusse (G-SCOP), Paul Revenant (ENS de Lyon)","submitted_at":"2024-05-24T11:39:09Z","abstract_excerpt":"In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the order picking problem in the case where the warehouse has two cross aisles. Their algorithm allow the tour to double cross an entire aisle. We prove that, in rectangular warehouses, there always exists a minimum length tour which doesn't double cross an aisle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15464","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/2405.15464/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-05T08:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSF7A/SXM+54XP8LWfxMTGQX2T6bmNrEXpsBPIJiuXD8lIMnEnnjxaZ+zHxMeIW6m/gJFNnWUIL9JT6kRdYvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:41:59.477955Z"},"content_sha256":"56aba919bbefe9e736cd441cad0c5788b9beb27de95918c514649e49a3ab9ec6","schema_version":"1.0","event_id":"sha256:56aba919bbefe9e736cd441cad0c5788b9beb27de95918c514649e49a3ab9ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6B3PBKX6FFLA526N2DW7WSUQW/bundle.json","state_url":"https://pith.science/pith/P6B3PBKX6FFLA526N2DW7WSUQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6B3PBKX6FFLA526N2DW7WSUQW/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-11T21:41:59Z","links":{"resolver":"https://pith.science/pith/P6B3PBKX6FFLA526N2DW7WSUQW","bundle":"https://pith.science/pith/P6B3PBKX6FFLA526N2DW7WSUQW/bundle.json","state":"https://pith.science/pith/P6B3PBKX6FFLA526N2DW7WSUQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6B3PBKX6FFLA526N2DW7WSUQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:P6B3PBKX6FFLA526N2DW7WSUQW","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":"32670504cf9278c87d053e55e36ad7944640077f59f8e7b12d3d59a44c7fad62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-24T11:39:09Z","title_canon_sha256":"c1f4b4d4784a8db4846ba32af13ee80862e651ba2b4bbe8d8f346dacace66c3e"},"schema_version":"1.0","source":{"id":"2405.15464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.15464","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"2405.15464v1","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.15464","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"P6B3PBKX6FFL","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_16","alias_value":"P6B3PBKX6FFLA526","created_at":"2026-07-05T08:22:50Z"},{"alias_kind":"pith_short_8","alias_value":"P6B3PBKX","created_at":"2026-07-05T08:22:50Z"}],"graph_snapshots":[{"event_id":"sha256:56aba919bbefe9e736cd441cad0c5788b9beb27de95918c514649e49a3ab9ec6","target":"graph","created_at":"2026-07-05T08:22:50Z","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/2405.15464/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the order picking problem, a picker has to collect a number of products in a warehouse with a minimum length tour. Ratliff and Rosenthal gave a linear algorithm solving the order picking problem in the case where the warehouse has two cross aisles. Their algorithm allow the tour to double cross an entire aisle. We prove that, in rectangular warehouses, there always exists a minimum length tour which doesn't double cross an aisle.","authors_text":"Hadrien Cambazard (G-SCOP), Nicolas Catusse (G-SCOP), Paul Revenant (ENS de Lyon)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-24T11:39:09Z","title":"A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.15464","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:9a6512153cd642c247b653ac143262ecbd223f6e02c75a44c6eb4523a3da0bad","target":"record","created_at":"2026-07-05T08:22:50Z","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":"32670504cf9278c87d053e55e36ad7944640077f59f8e7b12d3d59a44c7fad62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-24T11:39:09Z","title_canon_sha256":"c1f4b4d4784a8db4846ba32af13ee80862e651ba2b4bbe8d8f346dacace66c3e"},"schema_version":"1.0","source":{"id":"2405.15464","kind":"arxiv","version":1}},"canonical_sha256":"7f83b78557f14ab0775e6e876fda5485867e6ecfaceeabb18ed21933d087f75e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f83b78557f14ab0775e6e876fda5485867e6ecfaceeabb18ed21933d087f75e","first_computed_at":"2026-07-05T08:22:50.031783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:50.031783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sx06gDuiNplvJh84B9fPwDsYDKrj2nB0FQoAXF6WUSiJuf2LxzQBpF0hTEvSU4atTfEsJA0DUoaiQ5+zoHizBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:50.032255Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.15464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a6512153cd642c247b653ac143262ecbd223f6e02c75a44c6eb4523a3da0bad","sha256:56aba919bbefe9e736cd441cad0c5788b9beb27de95918c514649e49a3ab9ec6"],"state_sha256":"93ef493026cb237b757893493ec046a33b70d0321f6e8e76c674ed14929f6095"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcKuMpIhl9Vk2BrecItn8KNTuXqHTmaPWbee8bW4R0icMyjARhxgZp2AYPBkTr8HALYLbgNt8Pu4dHrJcMqTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:41:59.482863Z","bundle_sha256":"7fd762dec0b3b4e352d03744b61948db8819ccdb3b9927eec48cd24d975a8e0e"}}