{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:NLLNHMLOG47S5LTPMP4EZUBRGG","short_pith_number":"pith:NLLNHMLO","canonical_record":{"source":{"id":"2111.09087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2021-11-17T13:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"9a1731c3d8dbe50d8fc0b80a0226efd011f25275c12be59759b988fd2bfa1a3e","abstract_canon_sha256":"28a256ce7c08969cba4293d45f9d3082c0c4994da823d7cb64f6bd5e64aea569"},"schema_version":"1.0"},"canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","source":{"kind":"arxiv","id":"2111.09087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09087","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09087v1","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09087","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"NLLNHMLOG47S","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_16","alias_value":"NLLNHMLOG47S5LTP","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_8","alias_value":"NLLNHMLO","created_at":"2026-07-05T03:47:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:NLLNHMLOG47S5LTPMP4EZUBRGG","target":"record","payload":{"canonical_record":{"source":{"id":"2111.09087","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2021-11-17T13:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"9a1731c3d8dbe50d8fc0b80a0226efd011f25275c12be59759b988fd2bfa1a3e","abstract_canon_sha256":"28a256ce7c08969cba4293d45f9d3082c0c4994da823d7cb64f6bd5e64aea569"},"schema_version":"1.0"},"canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:55.782684Z","signature_b64":"V48a96dbMRm0ztw1To53riBBZshjPTyDotyDrzkW0dlbvdTazr4v9qM2itJDa5DfvVyaMSDa230eOsdwPY9uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","last_reissued_at":"2026-07-05T03:47:55.782238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:55.782238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.09087","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-05T03:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZVaJbqdAXnoTGcEVfJSxkkwZFDsQKGB1lqOCXRf6nXNCnkLwrgkBT0oE9AgtP3kIdJoHoAoT1tEcttkPCqvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:51:03.595954Z"},"content_sha256":"5826e7f82c213b352a8f3427425f197712d2f6564841a35410373b32a2063c3d","schema_version":"1.0","event_id":"sha256:5826e7f82c213b352a8f3427425f197712d2f6564841a35410373b32a2063c3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:NLLNHMLOG47S5LTPMP4EZUBRGG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Case Study of Vehicle Route Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Anthony Stein, Christian Krupitzer, Maximilian K\\\"onig, Samuel Kounev, Veronika Lesch","submitted_at":"2021-11-17T13:10:55Z","abstract_excerpt":"In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09087","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/2111.09087/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-05T03:47:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKZEC3vComjD/+5AVzbt7/4ybqEM9yia/oTJzu8/kbGqKGv0C0otgpSaVojZymVEYokvJGVn9qpLQRGJKMNEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T23:51:03.596336Z"},"content_sha256":"1da4b64afaa1ab2389072077dc6e53ea46d6739e0d8467da94b6b21e7abcbeb9","schema_version":"1.0","event_id":"sha256:1da4b64afaa1ab2389072077dc6e53ea46d6739e0d8467da94b6b21e7abcbeb9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/bundle.json","state_url":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/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-07-08T23:51:03Z","links":{"resolver":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG","bundle":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/bundle.json","state":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:NLLNHMLOG47S5LTPMP4EZUBRGG","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":"28a256ce7c08969cba4293d45f9d3082c0c4994da823d7cb64f6bd5e64aea569","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2021-11-17T13:10:55Z","title_canon_sha256":"9a1731c3d8dbe50d8fc0b80a0226efd011f25275c12be59759b988fd2bfa1a3e"},"schema_version":"1.0","source":{"id":"2111.09087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.09087","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"arxiv_version","alias_value":"2111.09087v1","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09087","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_12","alias_value":"NLLNHMLOG47S","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_16","alias_value":"NLLNHMLOG47S5LTP","created_at":"2026-07-05T03:47:55Z"},{"alias_kind":"pith_short_8","alias_value":"NLLNHMLO","created_at":"2026-07-05T03:47:55Z"}],"graph_snapshots":[{"event_id":"sha256:1da4b64afaa1ab2389072077dc6e53ea46d6739e0d8467da94b6b21e7abcbeb9","target":"graph","created_at":"2026-07-05T03:47:55Z","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/2111.09087/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strate","authors_text":"Anthony Stein, Christian Krupitzer, Maximilian K\\\"onig, Samuel Kounev, Veronika Lesch","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2021-11-17T13:10:55Z","title":"A Case Study of Vehicle Route Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.09087","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:5826e7f82c213b352a8f3427425f197712d2f6564841a35410373b32a2063c3d","target":"record","created_at":"2026-07-05T03:47:55Z","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":"28a256ce7c08969cba4293d45f9d3082c0c4994da823d7cb64f6bd5e64aea569","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2021-11-17T13:10:55Z","title_canon_sha256":"9a1731c3d8dbe50d8fc0b80a0226efd011f25275c12be59759b988fd2bfa1a3e"},"schema_version":"1.0","source":{"id":"2111.09087","kind":"arxiv","version":1}},"canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","first_computed_at":"2026-07-05T03:47:55.782238Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:47:55.782238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V48a96dbMRm0ztw1To53riBBZshjPTyDotyDrzkW0dlbvdTazr4v9qM2itJDa5DfvVyaMSDa230eOsdwPY9uDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:47:55.782684Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.09087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5826e7f82c213b352a8f3427425f197712d2f6564841a35410373b32a2063c3d","sha256:1da4b64afaa1ab2389072077dc6e53ea46d6739e0d8467da94b6b21e7abcbeb9"],"state_sha256":"6602ecd6a3ac77c0daab59c9a797e05f7ce903b088f5cbaeaff8cacedc8f16af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrPDAaPXijGb3fxH1bXCr1SprxqpH2G6P5UKrFpYfn9ltTPirnlGsrPRYMgij2EKXqDbBYzPZpBHhPo3ihaGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T23:51:03.598504Z","bundle_sha256":"96deaf96922668fb5277164d29e92cc9c58199052bf4178acc5ad6ac5d44bde3"}}