{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:56TWESJYNOFFGQX32OSBFV3BQZ","short_pith_number":"pith:56TWESJY","canonical_record":{"source":{"id":"2402.14868","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"62e6f05dbcd875c4e650424f47ee0cd309d3b1d98f15d9f25ec0a39bfa8e1243","abstract_canon_sha256":"c52e6eb80009ca6cfd2be417ee39727088923d44069ac59020bf7927b377db8d"},"schema_version":"1.0"},"canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","source":{"kind":"arxiv","id":"2402.14868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14868","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14868v1","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14868","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"56TWESJYNOFF","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_16","alias_value":"56TWESJYNOFFGQX3","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_8","alias_value":"56TWESJY","created_at":"2026-07-05T07:48:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:56TWESJYNOFFGQX32OSBFV3BQZ","target":"record","payload":{"canonical_record":{"source":{"id":"2402.14868","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","cross_cats_sorted":[],"title_canon_sha256":"62e6f05dbcd875c4e650424f47ee0cd309d3b1d98f15d9f25ec0a39bfa8e1243","abstract_canon_sha256":"c52e6eb80009ca6cfd2be417ee39727088923d44069ac59020bf7927b377db8d"},"schema_version":"1.0"},"canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:19.210168Z","signature_b64":"Il/dCuWpz/Qlj9DuCU5dxm3tfLbjzy9S5ccbY+ofV3EibpIggDFS8tIETkZrjEWHZYHidMhLFsDH3uNEV/ABAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","last_reissued_at":"2026-07-05T07:48:19.209700Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:19.209700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.14868","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-05T07:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSUxLqhZhC46gpIm95c871hEJ3+InpZyJFlVa+g63Msdj2JeMfCNfYuDSw/0J8OCz5lTwWNGfeneG58lYWRADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:55:38.605899Z"},"content_sha256":"72450acde6fcdc9a31daf932b77b724ebac93596bca976e518ce1caec1d7ef31","schema_version":"1.0","event_id":"sha256:72450acde6fcdc9a31daf932b77b724ebac93596bca976e518ce1caec1d7ef31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:56TWESJYNOFFGQX32OSBFV3BQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felix Tamke, Florian Lin{\\ss}, Leopold Kuttner, Udo Buscher","submitted_at":"2024-02-21T11:58:26Z","abstract_excerpt":"This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously infeasible route can become feasible by adding a new customer if support constraints are enabled in the loading subproblem and call this the incremental feasibility property. Consequently, different infeasible path definitions apply to different 3L-CVRP variants and we introduce several variant-depending lifting steps to strengthen infeasible path inequalities. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14868","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/2402.14868/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-05T07:48:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdmbufk2h1A68dWpcJz1dnfCAdWZMHhoFGZ64D3crkw1B/Jr36+Zatd2/5AdMY+eKBCGe7ukuPPHrW8X2Js9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:55:38.606233Z"},"content_sha256":"755487734a2e06a124fdd91cccfed63eb5a2f8049a368f426fa0f092445623e9","schema_version":"1.0","event_id":"sha256:755487734a2e06a124fdd91cccfed63eb5a2f8049a368f426fa0f092445623e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/bundle.json","state_url":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56TWESJYNOFFGQX32OSBFV3BQZ/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-23T11:55:38Z","links":{"resolver":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ","bundle":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/bundle.json","state":"https://pith.science/pith/56TWESJYNOFFGQX32OSBFV3BQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56TWESJYNOFFGQX32OSBFV3BQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:56TWESJYNOFFGQX32OSBFV3BQZ","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":"c52e6eb80009ca6cfd2be417ee39727088923d44069ac59020bf7927b377db8d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","title_canon_sha256":"62e6f05dbcd875c4e650424f47ee0cd309d3b1d98f15d9f25ec0a39bfa8e1243"},"schema_version":"1.0","source":{"id":"2402.14868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.14868","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.14868v1","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.14868","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_12","alias_value":"56TWESJYNOFF","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_16","alias_value":"56TWESJYNOFFGQX3","created_at":"2026-07-05T07:48:19Z"},{"alias_kind":"pith_short_8","alias_value":"56TWESJY","created_at":"2026-07-05T07:48:19Z"}],"graph_snapshots":[{"event_id":"sha256:755487734a2e06a124fdd91cccfed63eb5a2f8049a368f426fa0f092445623e9","target":"graph","created_at":"2026-07-05T07:48:19Z","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/2402.14868/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a new branch-and-cut algorithm based on infeasible path elimination for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) with different loading problem variants. We show that a previously infeasible route can become feasible by adding a new customer if support constraints are enabled in the loading subproblem and call this the incremental feasibility property. Consequently, different infeasible path definitions apply to different 3L-CVRP variants and we introduce several variant-depending lifting steps to strengthen infeasible path inequalities. T","authors_text":"Felix Tamke, Florian Lin{\\ss}, Leopold Kuttner, Udo Buscher","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","title":"A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.14868","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:72450acde6fcdc9a31daf932b77b724ebac93596bca976e518ce1caec1d7ef31","target":"record","created_at":"2026-07-05T07:48:19Z","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":"c52e6eb80009ca6cfd2be417ee39727088923d44069ac59020bf7927b377db8d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-02-21T11:58:26Z","title_canon_sha256":"62e6f05dbcd875c4e650424f47ee0cd309d3b1d98f15d9f25ec0a39bfa8e1243"},"schema_version":"1.0","source":{"id":"2402.14868","kind":"arxiv","version":1}},"canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efa76249386b8a5342fbd3a412d761864c44e1c1ec5813e74dd541280ea2604f","first_computed_at":"2026-07-05T07:48:19.209700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:48:19.209700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Il/dCuWpz/Qlj9DuCU5dxm3tfLbjzy9S5ccbY+ofV3EibpIggDFS8tIETkZrjEWHZYHidMhLFsDH3uNEV/ABAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:48:19.210168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.14868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72450acde6fcdc9a31daf932b77b724ebac93596bca976e518ce1caec1d7ef31","sha256:755487734a2e06a124fdd91cccfed63eb5a2f8049a368f426fa0f092445623e9"],"state_sha256":"73083c22718757b3c8d344f6221953cd5ddc29f9b2b63d55f06a54e82bdde979"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JYUatTcdmaeYmnUDoXfzDmW2ZocsD1mmZ80I+kyExKMIylNwIqDJCOnREdX3JN6RN3/eMaLNI07UKAYCLYWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:55:38.609239Z","bundle_sha256":"00f867d9ee544e050c8c8e035aa1800c18ce92b63bf5c7e56ba552c560c7244a"}}