{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:MXRA2IQBS2Q6YFEQBZLYTNZEIV","short_pith_number":"pith:MXRA2IQB","schema_version":"1.0","canonical_sha256":"65e20d220196a1ec14900e5789b7244547f0ca807d2174fe2eaf3ba21653a311","source":{"kind":"arxiv","id":"2105.10950","version":1},"attestation_state":"computed","paper":{"title":"A review of approaches to modeling applied vehicle routing problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Morozov, Konstantin Sidorov","submitted_at":"2021-05-23T14:50:14Z","abstract_excerpt":"Due to the practical importance of vehicle routing problems (VRP), there exists an ever-growing body of research in algorithms and (meta)heuristics for solving such problems. However, the diversity of VRP domains creates the separate problem of modeling such problems -- describing the domain entities (and, in particular, the planning decisions), the set of valid planning decisions, and the preferences between different plans. In this paper, we review the approaches for modeling vehicle routing problems. To make the comparison more straightforward, we formulate several criteria for evaluating m"},"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":"2105.10950","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-05-23T14:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"3f035c487a6653967c428bea150946a69b29ec625ffa5b001dfd9fae49e2544b","abstract_canon_sha256":"06685fa1097c85c40235cf22e94a82a20fa12b9012635bad0562e9d4833a5833"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:33.967118Z","signature_b64":"9xLqkDI7eKuXZk4BX7KzGe/HWG/c245I9NfcAtnS0TsIERqy8kvpZw+xLVW+P6pZumK1fuul1Ns1h84/3I6zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e20d220196a1ec14900e5789b7244547f0ca807d2174fe2eaf3ba21653a311","last_reissued_at":"2026-07-05T02:42:33.966729Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:33.966729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A review of approaches to modeling applied vehicle routing problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexander Morozov, Konstantin Sidorov","submitted_at":"2021-05-23T14:50:14Z","abstract_excerpt":"Due to the practical importance of vehicle routing problems (VRP), there exists an ever-growing body of research in algorithms and (meta)heuristics for solving such problems. However, the diversity of VRP domains creates the separate problem of modeling such problems -- describing the domain entities (and, in particular, the planning decisions), the set of valid planning decisions, and the preferences between different plans. In this paper, we review the approaches for modeling vehicle routing problems. To make the comparison more straightforward, we formulate several criteria for evaluating m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10950","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/2105.10950/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":"2105.10950","created_at":"2026-07-05T02:42:33.966781+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.10950v1","created_at":"2026-07-05T02:42:33.966781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10950","created_at":"2026-07-05T02:42:33.966781+00:00"},{"alias_kind":"pith_short_12","alias_value":"MXRA2IQBS2Q6","created_at":"2026-07-05T02:42:33.966781+00:00"},{"alias_kind":"pith_short_16","alias_value":"MXRA2IQBS2Q6YFEQ","created_at":"2026-07-05T02:42:33.966781+00:00"},{"alias_kind":"pith_short_8","alias_value":"MXRA2IQB","created_at":"2026-07-05T02:42:33.966781+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05394","citing_title":"Feasibility-Preserving Quantum Search for Constrained Transportation Routing","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV","json":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV.json","graph_json":"https://pith.science/api/pith-number/MXRA2IQBS2Q6YFEQBZLYTNZEIV/graph.json","events_json":"https://pith.science/api/pith-number/MXRA2IQBS2Q6YFEQBZLYTNZEIV/events.json","paper":"https://pith.science/paper/MXRA2IQB"},"agent_actions":{"view_html":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV","download_json":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV.json","view_paper":"https://pith.science/paper/MXRA2IQB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.10950&json=true","fetch_graph":"https://pith.science/api/pith-number/MXRA2IQBS2Q6YFEQBZLYTNZEIV/graph.json","fetch_events":"https://pith.science/api/pith-number/MXRA2IQBS2Q6YFEQBZLYTNZEIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV/action/storage_attestation","attest_author":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV/action/author_attestation","sign_citation":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV/action/citation_signature","submit_replication":"https://pith.science/pith/MXRA2IQBS2Q6YFEQBZLYTNZEIV/action/replication_record"}},"created_at":"2026-07-05T02:42:33.966781+00:00","updated_at":"2026-07-05T02:42:33.966781+00:00"}