{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:JCXHJAZ54QARD3PL4EQCFV4ONX","short_pith_number":"pith:JCXHJAZ5","schema_version":"1.0","canonical_sha256":"48ae74833de40111edebe12022d78e6dca9b4034540c55d26273686429cff807","source":{"kind":"arxiv","id":"2505.21887","version":2},"attestation_state":"computed","paper":{"title":"SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ahmed Heakl, Martin Takac, Salem Lahlou, Yahia Salaheldin Shaaban, Zangir Iklassov","submitted_at":"2025-05-28T02:03:31Z","abstract_excerpt":"Robust routing under uncertainty is central to real-world logistics, yet most benchmarks assume static, idealized settings. We present SVRPBench, the first open benchmark to capture high-fidelity stochastic dynamics in vehicle routing at urban scale. Spanning more than 500 instances with up to 1000 customers, it simulates realistic delivery conditions: time-dependent congestion, log-normal delays, probabilistic accidents, and empirically grounded time windows for residential and commercial clients. Our pipeline generates diverse, constraint-rich scenarios, including multi-depot and multi-vehic"},"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":"2505.21887","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-05-28T02:03:31Z","cross_cats_sorted":["cs.CE","cs.LG"],"title_canon_sha256":"15a0002506515ce088e7e82108d908db7af06cdebb98e711fe91cc53141f9ced","abstract_canon_sha256":"9d2cf1dd65773d3979428a794ea51bb3ff29498211aa4b3a902cc9a29c9fc294"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:47.530627Z","signature_b64":"YzAnVEIYNOkiNr1TOFhV+fScsBT3kKyw/twvE7rB1e6UrDrebTGP4yNXQ71UIlno2N4y97sxefQtzsa+l1kVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48ae74833de40111edebe12022d78e6dca9b4034540c55d26273686429cff807","last_reissued_at":"2026-07-05T11:11:47.530123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:47.530123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","cs.LG"],"primary_cat":"cs.AI","authors_text":"Ahmed Heakl, Martin Takac, Salem Lahlou, Yahia Salaheldin Shaaban, Zangir Iklassov","submitted_at":"2025-05-28T02:03:31Z","abstract_excerpt":"Robust routing under uncertainty is central to real-world logistics, yet most benchmarks assume static, idealized settings. We present SVRPBench, the first open benchmark to capture high-fidelity stochastic dynamics in vehicle routing at urban scale. Spanning more than 500 instances with up to 1000 customers, it simulates realistic delivery conditions: time-dependent congestion, log-normal delays, probabilistic accidents, and empirically grounded time windows for residential and commercial clients. Our pipeline generates diverse, constraint-rich scenarios, including multi-depot and multi-vehic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.21887","kind":"arxiv","version":2},"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/2505.21887/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":"2505.21887","created_at":"2026-07-05T11:11:47.530181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.21887v2","created_at":"2026-07-05T11:11:47.530181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.21887","created_at":"2026-07-05T11:11:47.530181+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCXHJAZ54QAR","created_at":"2026-07-05T11:11:47.530181+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCXHJAZ54QARD3PL","created_at":"2026-07-05T11:11:47.530181+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCXHJAZ5","created_at":"2026-07-05T11:11:47.530181+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00604","citing_title":"Vehicle Routing Problem Meets Large Language Models: An Overview and Perspectives","ref_index":93,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX","json":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX.json","graph_json":"https://pith.science/api/pith-number/JCXHJAZ54QARD3PL4EQCFV4ONX/graph.json","events_json":"https://pith.science/api/pith-number/JCXHJAZ54QARD3PL4EQCFV4ONX/events.json","paper":"https://pith.science/paper/JCXHJAZ5"},"agent_actions":{"view_html":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX","download_json":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX.json","view_paper":"https://pith.science/paper/JCXHJAZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.21887&json=true","fetch_graph":"https://pith.science/api/pith-number/JCXHJAZ54QARD3PL4EQCFV4ONX/graph.json","fetch_events":"https://pith.science/api/pith-number/JCXHJAZ54QARD3PL4EQCFV4ONX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX/action/storage_attestation","attest_author":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX/action/author_attestation","sign_citation":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX/action/citation_signature","submit_replication":"https://pith.science/pith/JCXHJAZ54QARD3PL4EQCFV4ONX/action/replication_record"}},"created_at":"2026-07-05T11:11:47.530181+00:00","updated_at":"2026-07-05T11:11:47.530181+00:00"}