{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C2COSRZIAU6P6UDLFPOY6AYB2Y","short_pith_number":"pith:C2COSRZI","schema_version":"1.0","canonical_sha256":"1684e94728053cff506b2bdd8f0301d622066efbde57f17ece36a27ae8df7ef5","source":{"kind":"arxiv","id":"2403.04420","version":1},"attestation_state":"computed","paper":{"title":"Adaptive Memory Procedure for Solving Real-world Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikica Peric, Slaven Begovic, Vinko Lesic","submitted_at":"2024-03-07T11:37:47Z","abstract_excerpt":"Logistics and transport are core of many industrial and business processes. One of the most promising segments in the field is optimisation of vehicle routes. Scientific effort is focused primarily on algorithms developed in simplified environment and cover a fraction of real industrial application due to complex combinatorial algorithms required to be promptly executed. In this paper, a real-world case study in all its complexity is observed and formulated as a real-world vehicle routing problem (VRP). To be able to computationally cope with the complexity, we propose a new procedure based on"},"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":"2403.04420","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2024-03-07T11:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"ff273797ee6d75fbe044b5154b249be3e21842bb53d858211540cebd14f69a5b","abstract_canon_sha256":"e034e9fea5d35ef2e7d125d0962b4bb799a61ed397fd368fae8f7effef52e8ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:23.217728Z","signature_b64":"KX7LnT/M/OD5BTjr9vYwGMXHoPWx+K1scUYQPeUicMeaFA2zwSUXuGUxQNi23Lnq2AWdaLwPnFveIaVMv+c1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1684e94728053cff506b2bdd8f0301d622066efbde57f17ece36a27ae8df7ef5","last_reissued_at":"2026-07-05T07:53:23.217229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:23.217229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Memory Procedure for Solving Real-world Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikica Peric, Slaven Begovic, Vinko Lesic","submitted_at":"2024-03-07T11:37:47Z","abstract_excerpt":"Logistics and transport are core of many industrial and business processes. One of the most promising segments in the field is optimisation of vehicle routes. Scientific effort is focused primarily on algorithms developed in simplified environment and cover a fraction of real industrial application due to complex combinatorial algorithms required to be promptly executed. In this paper, a real-world case study in all its complexity is observed and formulated as a real-world vehicle routing problem (VRP). To be able to computationally cope with the complexity, we propose a new procedure based on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04420","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/2403.04420/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":"2403.04420","created_at":"2026-07-05T07:53:23.217286+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.04420v1","created_at":"2026-07-05T07:53:23.217286+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04420","created_at":"2026-07-05T07:53:23.217286+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2COSRZIAU6P","created_at":"2026-07-05T07:53:23.217286+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2COSRZIAU6P6UDL","created_at":"2026-07-05T07:53:23.217286+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2COSRZI","created_at":"2026-07-05T07:53:23.217286+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21887","citing_title":"SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y","json":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y.json","graph_json":"https://pith.science/api/pith-number/C2COSRZIAU6P6UDLFPOY6AYB2Y/graph.json","events_json":"https://pith.science/api/pith-number/C2COSRZIAU6P6UDLFPOY6AYB2Y/events.json","paper":"https://pith.science/paper/C2COSRZI"},"agent_actions":{"view_html":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y","download_json":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y.json","view_paper":"https://pith.science/paper/C2COSRZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.04420&json=true","fetch_graph":"https://pith.science/api/pith-number/C2COSRZIAU6P6UDLFPOY6AYB2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/C2COSRZIAU6P6UDLFPOY6AYB2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y/action/storage_attestation","attest_author":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y/action/author_attestation","sign_citation":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y/action/citation_signature","submit_replication":"https://pith.science/pith/C2COSRZIAU6P6UDLFPOY6AYB2Y/action/replication_record"}},"created_at":"2026-07-05T07:53:23.217286+00:00","updated_at":"2026-07-05T07:53:23.217286+00:00"}