{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PGFMEC4DUL3LH7LNH4EUDZNGKB","short_pith_number":"pith:PGFMEC4D","canonical_record":{"source":{"id":"1802.08042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"14f5cdb73a092c638f61109e35625d56883691004a4355f0ee4d4f2daccebdef","abstract_canon_sha256":"e6a6d207a753d43fd416ec3d72c491fbc1eaa0819c9d318a62a49f9d24ee7bd6"},"schema_version":"1.0"},"canonical_sha256":"798ac20b83a2f6b3fd6d3f0941e5a65055c0708f429c30d8eecd43a039ee5879","source":{"kind":"arxiv","id":"1802.08042","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08042","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08042v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08042","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"PGFMEC4DUL3L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGFMEC4DUL3LH7LN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGFMEC4D","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PGFMEC4DUL3LH7LNH4EUDZNGKB","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"14f5cdb73a092c638f61109e35625d56883691004a4355f0ee4d4f2daccebdef","abstract_canon_sha256":"e6a6d207a753d43fd416ec3d72c491fbc1eaa0819c9d318a62a49f9d24ee7bd6"},"schema_version":"1.0"},"canonical_sha256":"798ac20b83a2f6b3fd6d3f0941e5a65055c0708f429c30d8eecd43a039ee5879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:45.765933Z","signature_b64":"uqbNYYdqrprIfTr9P5o35wWt5Lb1M4PPZMoWdmyVUfsZ+IcVGc+0Apefi5wdlLF2vznuLp8VEpQlbClGESNpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798ac20b83a2f6b3fd6d3f0941e5a65055c0708f429c30d8eecd43a039ee5879","last_reissued_at":"2026-05-18T00:22:45.765264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:45.765264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08042","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-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TX2aGfGsQUQYSEJuivTX3Ab+zdn/nKoORT83hC9pazH6mkpycGp9YgqXgnUYp99fC2oWqODDVIL8Pi0iepWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:51:14.384118Z"},"content_sha256":"dc4c869fb7d6b10e38bd75b27aea10c34565dd86228ed19e7b027f6d7b1eb687","schema_version":"1.0","event_id":"sha256:dc4c869fb7d6b10e38bd75b27aea10c34565dd86228ed19e7b027f6d7b1eb687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PGFMEC4DUL3LH7LNH4EUDZNGKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"2VRP: a benchmark problem for small but rich VRPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bettina Klinz, Vladimir Deineko","submitted_at":"2018-02-22T13:50:06Z","abstract_excerpt":"We consider a 2-vehicle routing problem (2VRP) which can be viewed as a building block for the variety of vehicle routing problems (VRP). As a simplified version of the 2VRP, we consider a 2-period balanced travelling salesman problem (2TSP) and describe a polynomially solvable case of this NP-hard problem. For the 2VRP with general settings, we suggest a framework based on the Held and Karp dynamic programming algorithm. Our algorithms based on this framework show an exceptionally good performance on the published test data. Our approach can be easily extended to a variety of constraints/attr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08042","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-18T00:22:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFv4DcBO46tuPlbBVYrTY6s7/JchYpzfRZnI+AonT45OXzwBpPm+nnpcuNXXzxVDRAIvKcnusWX+4Ikd3og3DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:51:14.384481Z"},"content_sha256":"1e469c97093b77672d7770534e7beaa21e359412ecb5d47a2b6b1928c05e17b4","schema_version":"1.0","event_id":"sha256:1e469c97093b77672d7770534e7beaa21e359412ecb5d47a2b6b1928c05e17b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/bundle.json","state_url":"https://pith.science/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/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-23T08:51:14Z","links":{"resolver":"https://pith.science/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB","bundle":"https://pith.science/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/bundle.json","state":"https://pith.science/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PGFMEC4DUL3LH7LNH4EUDZNGKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PGFMEC4DUL3LH7LNH4EUDZNGKB","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":"e6a6d207a753d43fd416ec3d72c491fbc1eaa0819c9d318a62a49f9d24ee7bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:50:06Z","title_canon_sha256":"14f5cdb73a092c638f61109e35625d56883691004a4355f0ee4d4f2daccebdef"},"schema_version":"1.0","source":{"id":"1802.08042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08042","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08042v1","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08042","created_at":"2026-05-18T00:22:45Z"},{"alias_kind":"pith_short_12","alias_value":"PGFMEC4DUL3L","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PGFMEC4DUL3LH7LN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PGFMEC4D","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:1e469c97093b77672d7770534e7beaa21e359412ecb5d47a2b6b1928c05e17b4","target":"graph","created_at":"2026-05-18T00:22:45Z","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 consider a 2-vehicle routing problem (2VRP) which can be viewed as a building block for the variety of vehicle routing problems (VRP). As a simplified version of the 2VRP, we consider a 2-period balanced travelling salesman problem (2TSP) and describe a polynomially solvable case of this NP-hard problem. For the 2VRP with general settings, we suggest a framework based on the Held and Karp dynamic programming algorithm. Our algorithms based on this framework show an exceptionally good performance on the published test data. Our approach can be easily extended to a variety of constraints/attr","authors_text":"Bettina Klinz, Vladimir Deineko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:50:06Z","title":"2VRP: a benchmark problem for small but rich VRPs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08042","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:dc4c869fb7d6b10e38bd75b27aea10c34565dd86228ed19e7b027f6d7b1eb687","target":"record","created_at":"2026-05-18T00:22:45Z","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":"e6a6d207a753d43fd416ec3d72c491fbc1eaa0819c9d318a62a49f9d24ee7bd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:50:06Z","title_canon_sha256":"14f5cdb73a092c638f61109e35625d56883691004a4355f0ee4d4f2daccebdef"},"schema_version":"1.0","source":{"id":"1802.08042","kind":"arxiv","version":1}},"canonical_sha256":"798ac20b83a2f6b3fd6d3f0941e5a65055c0708f429c30d8eecd43a039ee5879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"798ac20b83a2f6b3fd6d3f0941e5a65055c0708f429c30d8eecd43a039ee5879","first_computed_at":"2026-05-18T00:22:45.765264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:45.765264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uqbNYYdqrprIfTr9P5o35wWt5Lb1M4PPZMoWdmyVUfsZ+IcVGc+0Apefi5wdlLF2vznuLp8VEpQlbClGESNpCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:45.765933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc4c869fb7d6b10e38bd75b27aea10c34565dd86228ed19e7b027f6d7b1eb687","sha256:1e469c97093b77672d7770534e7beaa21e359412ecb5d47a2b6b1928c05e17b4"],"state_sha256":"2715ef1fa910e0f20a9a31c80f5d817b679f9cc94a77bdf11cb7eeabf4a06b50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpXv2o5U8w92PSznb1sVAuN+EOs3GLBnmd2nXVbGF2Ah5uT7y0yavbAM55/eBYXrGDpVltjHFCa1Gx5CUp0nAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:51:14.386431Z","bundle_sha256":"911a1286ad80a1bba8a1bd7b30bab7da846cab355339de0934a8d7f2f77de2a4"}}