{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2K3AE4E6HBWJHHEOF44WF7QRKR","short_pith_number":"pith:2K3AE4E6","canonical_record":{"source":{"id":"1512.07449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"53a9141c25be64f7b528751fb86e96c73ec60475e906a69b094a3f703c32b43d","abstract_canon_sha256":"6c6920c0215d1738c1306b9a08ecf4026f56768b794c7c5118f1b31b8e3ade70"},"schema_version":"1.0"},"canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","source":{"kind":"arxiv","id":"1512.07449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07449","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07449v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07449","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"2K3AE4E6HBWJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2K3AE4E6HBWJHHEO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2K3AE4E6","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2K3AE4E6HBWJHHEOF44WF7QRKR","target":"record","payload":{"canonical_record":{"source":{"id":"1512.07449","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"53a9141c25be64f7b528751fb86e96c73ec60475e906a69b094a3f703c32b43d","abstract_canon_sha256":"6c6920c0215d1738c1306b9a08ecf4026f56768b794c7c5118f1b31b8e3ade70"},"schema_version":"1.0"},"canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.645474Z","signature_b64":"vbpO++3j8cylyPtCsucZTI6jOoPmCUF2hTRtCLXbesDfKX/2jD4YqNuSKLhprpAZu4LELJrplM6g/M9N7GV1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","last_reissued_at":"2026-05-18T01:23:49.644826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.644826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.07449","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-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lW0isyAM1EqYn4VW5Cgmek3fA6S5V8O/0yBUiWgHRsYOl/QaNa4J7om+a4DIguri1OYTKElay002xIzc999UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:28.841085Z"},"content_sha256":"bdfbf06b789b283b00ffd05996635b5c5369a4ebc1a02102df74d1206a54c0c3","schema_version":"1.0","event_id":"sha256:bdfbf06b789b283b00ffd05996635b5c5369a4ebc1a02102df74d1206a54c0c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2K3AE4E6HBWJHHEOF44WF7QRKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The lateral transhipment problem with a-priori routes, and a lot sizing application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Romauch, Richard F. Hartl, Thibaut Vidal","submitted_at":"2015-12-23T12:28:10Z","abstract_excerpt":"We propose exact solution approaches for a lateral transhipment problem which, given a pre-specified sequence of customers, seeks an optimal inventory redistribution plan considering travel costs and profits dependent on inventory levels. Trip-duration and vehicle-capacity constraints are also imposed. The same problem arises in some lot sizing applications, in the presence of setup costs and equipment re-qualifications.\n  We introduce a pure dynamic programming approach and a branch-and-bound framework that combines dynamic programming with Lagrangian relaxation. Computational experiments are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07449","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":""},"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-18T01:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dh+146xFSjsvguFt9pZ/HgBhRLm86ks3pQ6OKTpmFtBVOipv0h+GHjEeMj9CTo4hqBj+WGNLvjFRrOg7fDXCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:54:28.841752Z"},"content_sha256":"8ad4b5433ffedc06cd6e3d39c00bacb947bff05f89a3682472c2550c6573f5c1","schema_version":"1.0","event_id":"sha256:8ad4b5433ffedc06cd6e3d39c00bacb947bff05f89a3682472c2550c6573f5c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/bundle.json","state_url":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/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-05-25T22:54:28Z","links":{"resolver":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR","bundle":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/bundle.json","state":"https://pith.science/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2K3AE4E6HBWJHHEOF44WF7QRKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2K3AE4E6HBWJHHEOF44WF7QRKR","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":"6c6920c0215d1738c1306b9a08ecf4026f56768b794c7c5118f1b31b8e3ade70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","title_canon_sha256":"53a9141c25be64f7b528751fb86e96c73ec60475e906a69b094a3f703c32b43d"},"schema_version":"1.0","source":{"id":"1512.07449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.07449","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1512.07449v1","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07449","created_at":"2026-05-18T01:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"2K3AE4E6HBWJ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2K3AE4E6HBWJHHEO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2K3AE4E6","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:8ad4b5433ffedc06cd6e3d39c00bacb947bff05f89a3682472c2550c6573f5c1","target":"graph","created_at":"2026-05-18T01:23:49Z","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":"We propose exact solution approaches for a lateral transhipment problem which, given a pre-specified sequence of customers, seeks an optimal inventory redistribution plan considering travel costs and profits dependent on inventory levels. Trip-duration and vehicle-capacity constraints are also imposed. The same problem arises in some lot sizing applications, in the presence of setup costs and equipment re-qualifications.\n  We introduce a pure dynamic programming approach and a branch-and-bound framework that combines dynamic programming with Lagrangian relaxation. Computational experiments are","authors_text":"Martin Romauch, Richard F. Hartl, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","title":"The lateral transhipment problem with a-priori routes, and a lot sizing application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07449","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:bdfbf06b789b283b00ffd05996635b5c5369a4ebc1a02102df74d1206a54c0c3","target":"record","created_at":"2026-05-18T01:23:49Z","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":"6c6920c0215d1738c1306b9a08ecf4026f56768b794c7c5118f1b31b8e3ade70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-23T12:28:10Z","title_canon_sha256":"53a9141c25be64f7b528751fb86e96c73ec60475e906a69b094a3f703c32b43d"},"schema_version":"1.0","source":{"id":"1512.07449","kind":"arxiv","version":1}},"canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2b602709e386c939c8e2f3962fe115475a8657e9c7208215b4ac48a71324d85","first_computed_at":"2026-05-18T01:23:49.644826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:49.644826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vbpO++3j8cylyPtCsucZTI6jOoPmCUF2hTRtCLXbesDfKX/2jD4YqNuSKLhprpAZu4LELJrplM6g/M9N7GV1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:49.645474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.07449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdfbf06b789b283b00ffd05996635b5c5369a4ebc1a02102df74d1206a54c0c3","sha256:8ad4b5433ffedc06cd6e3d39c00bacb947bff05f89a3682472c2550c6573f5c1"],"state_sha256":"02d64dabfebf70e437ddfc5d131e6f341c33fe7959223057556ed6b99a3b383a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3Sd7NGtzrKMAxornk8A5lwzMoavZGiLJy8b2W76OClj+rlg+Tm+OZk5q5Zfh/D603JbNQ2cHc8sNxrorgRxBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:54:28.845248Z","bundle_sha256":"40e7c60746dd1af886c60dfe01bf025982770f16936e1f24d9d24caf5e170041"}}