{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NLLNHMLOG47S5LTPMP4EZUBRGG","short_pith_number":"pith:NLLNHMLO","schema_version":"1.0","canonical_sha256":"6ad6d3b16e373f2eae6f63f84cd0313182e15f330ae0ecc4f95cd8cc0e6139c0","source":{"kind":"arxiv","id":"2111.09087","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.09087","created_at":"2026-07-05T03:47:55.782298+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.09087v1","created_at":"2026-07-05T03:47:55.782298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.09087","created_at":"2026-07-05T03:47:55.782298+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLLNHMLOG47S","created_at":"2026-07-05T03:47:55.782298+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLLNHMLOG47S5LTP","created_at":"2026-07-05T03:47:55.782298+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLLNHMLO","created_at":"2026-07-05T03:47:55.782298+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG","json":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG.json","graph_json":"https://pith.science/api/pith-number/NLLNHMLOG47S5LTPMP4EZUBRGG/graph.json","events_json":"https://pith.science/api/pith-number/NLLNHMLOG47S5LTPMP4EZUBRGG/events.json","paper":"https://pith.science/paper/NLLNHMLO"},"agent_actions":{"view_html":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG","download_json":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG.json","view_paper":"https://pith.science/paper/NLLNHMLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.09087&json=true","fetch_graph":"https://pith.science/api/pith-number/NLLNHMLOG47S5LTPMP4EZUBRGG/graph.json","fetch_events":"https://pith.science/api/pith-number/NLLNHMLOG47S5LTPMP4EZUBRGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/action/storage_attestation","attest_author":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/action/author_attestation","sign_citation":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/action/citation_signature","submit_replication":"https://pith.science/pith/NLLNHMLOG47S5LTPMP4EZUBRGG/action/replication_record"}},"created_at":"2026-07-05T03:47:55.782298+00:00","updated_at":"2026-07-05T03:47:55.782298+00:00"}