{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DTAFPHXOA4LGSZ3UKTS2DL2PUZ","short_pith_number":"pith:DTAFPHXO","canonical_record":{"source":{"id":"2306.14205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-25T11:09:30Z","cross_cats_sorted":[],"title_canon_sha256":"d93fa970edbe5c2153edd6e1ce022cadf84a09fb78d03b0819646477b1c26191","abstract_canon_sha256":"0c0b75f359292b1823d4cb2a77ec0191576ba90d33b36a23e6d6ff149e6a5851"},"schema_version":"1.0"},"canonical_sha256":"1cc0579eee071669677454e5a1af4fa67489d5a20f87d02783cf519c35b56bbf","source":{"kind":"arxiv","id":"2306.14205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.14205","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"2306.14205v1","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14205","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"DTAFPHXOA4LG","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_16","alias_value":"DTAFPHXOA4LGSZ3U","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_8","alias_value":"DTAFPHXO","created_at":"2026-07-05T06:24:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DTAFPHXOA4LGSZ3UKTS2DL2PUZ","target":"record","payload":{"canonical_record":{"source":{"id":"2306.14205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-25T11:09:30Z","cross_cats_sorted":[],"title_canon_sha256":"d93fa970edbe5c2153edd6e1ce022cadf84a09fb78d03b0819646477b1c26191","abstract_canon_sha256":"0c0b75f359292b1823d4cb2a77ec0191576ba90d33b36a23e6d6ff149e6a5851"},"schema_version":"1.0"},"canonical_sha256":"1cc0579eee071669677454e5a1af4fa67489d5a20f87d02783cf519c35b56bbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:33.086196Z","signature_b64":"QDA64DgyEMsncnyF7o3+XyxyHFobReFhPCeuEkKXgicAjVD6sFOdxDkF6Ds6M29gIS5L2zH2cX3QXQM5hKgjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cc0579eee071669677454e5a1af4fa67489d5a20f87d02783cf519c35b56bbf","last_reissued_at":"2026-07-05T06:24:33.085762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:33.085762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.14205","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-05T06:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYYH7eD9LPEVU8n4Olt03iOpeFBUahI15Ja8H8xrj3a1opMU0RjL2Qu9BixoUhci+y05Ovsm3UFasdvks6C2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:40:14.802076Z"},"content_sha256":"e8f247819ef35b5f0bbd21cbc86eb048798565c237f033dd5dcd812450184ea3","schema_version":"1.0","event_id":"sha256:e8f247819ef35b5f0bbd21cbc86eb048798565c237f033dd5dcd812450184ea3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DTAFPHXOA4LGSZ3UKTS2DL2PUZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing One Million Customers in a Handful of Minutes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Daniele Vigo, Luca Accorsi","submitted_at":"2023-06-25T11:09:30Z","abstract_excerpt":"In this paper, we propose a new dataset of Capacitated Vehicle Routing Problem instances which are up to two orders of magnitude larger than those in the currently used benchmarks. Despite these sizes might not have an immediate application to real-world logistic scenarios, we believe they could foster fresh new research efforts on the design of effective and efficient algorithmic components for routing problems. We provide computational results for such instances by running FILO2, an adaptation of the FILO algorithm proposed in Accorsi and Vigo (2021), designed to handle extremely large-scale"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14205","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/2306.14205/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-05T06:24:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uQNS243CuVJKHBoBSW1/m9z1+91ntZDv+u5dGUDTMk6PczsFvu6HGTS1zjbRGlB+Bh3LB5A+zDkiu5smpbNRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T05:40:14.802744Z"},"content_sha256":"1381946fde384b8ac82a3cfdddae3cda46e79147adad96f0d0827d1e5440547c","schema_version":"1.0","event_id":"sha256:1381946fde384b8ac82a3cfdddae3cda46e79147adad96f0d0827d1e5440547c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/bundle.json","state_url":"https://pith.science/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/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-09T05:40:14Z","links":{"resolver":"https://pith.science/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ","bundle":"https://pith.science/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/bundle.json","state":"https://pith.science/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTAFPHXOA4LGSZ3UKTS2DL2PUZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DTAFPHXOA4LGSZ3UKTS2DL2PUZ","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":"0c0b75f359292b1823d4cb2a77ec0191576ba90d33b36a23e6d6ff149e6a5851","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-25T11:09:30Z","title_canon_sha256":"d93fa970edbe5c2153edd6e1ce022cadf84a09fb78d03b0819646477b1c26191"},"schema_version":"1.0","source":{"id":"2306.14205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.14205","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"arxiv_version","alias_value":"2306.14205v1","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14205","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_12","alias_value":"DTAFPHXOA4LG","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_16","alias_value":"DTAFPHXOA4LGSZ3U","created_at":"2026-07-05T06:24:33Z"},{"alias_kind":"pith_short_8","alias_value":"DTAFPHXO","created_at":"2026-07-05T06:24:33Z"}],"graph_snapshots":[{"event_id":"sha256:1381946fde384b8ac82a3cfdddae3cda46e79147adad96f0d0827d1e5440547c","target":"graph","created_at":"2026-07-05T06:24:33Z","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/2306.14205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a new dataset of Capacitated Vehicle Routing Problem instances which are up to two orders of magnitude larger than those in the currently used benchmarks. Despite these sizes might not have an immediate application to real-world logistic scenarios, we believe they could foster fresh new research efforts on the design of effective and efficient algorithmic components for routing problems. We provide computational results for such instances by running FILO2, an adaptation of the FILO algorithm proposed in Accorsi and Vigo (2021), designed to handle extremely large-scale","authors_text":"Daniele Vigo, Luca Accorsi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-25T11:09:30Z","title":"Routing One Million Customers in a Handful of Minutes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14205","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:e8f247819ef35b5f0bbd21cbc86eb048798565c237f033dd5dcd812450184ea3","target":"record","created_at":"2026-07-05T06:24:33Z","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":"0c0b75f359292b1823d4cb2a77ec0191576ba90d33b36a23e6d6ff149e6a5851","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-06-25T11:09:30Z","title_canon_sha256":"d93fa970edbe5c2153edd6e1ce022cadf84a09fb78d03b0819646477b1c26191"},"schema_version":"1.0","source":{"id":"2306.14205","kind":"arxiv","version":1}},"canonical_sha256":"1cc0579eee071669677454e5a1af4fa67489d5a20f87d02783cf519c35b56bbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cc0579eee071669677454e5a1af4fa67489d5a20f87d02783cf519c35b56bbf","first_computed_at":"2026-07-05T06:24:33.085762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:24:33.085762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QDA64DgyEMsncnyF7o3+XyxyHFobReFhPCeuEkKXgicAjVD6sFOdxDkF6Ds6M29gIS5L2zH2cX3QXQM5hKgjDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:24:33.086196Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.14205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8f247819ef35b5f0bbd21cbc86eb048798565c237f033dd5dcd812450184ea3","sha256:1381946fde384b8ac82a3cfdddae3cda46e79147adad96f0d0827d1e5440547c"],"state_sha256":"b2e47526beb75bbb6eca95a297c99f755c2584f5eaaeec60ed3ddc848f703abf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSqFVKtNRkjb8IMyAaA4sT7jzyrOS/U3taD7M1ov8SlLMiDnOY8sW8DVhXKGPVJw+Xcw91viS/3HQ6Qrkq53Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T05:40:14.806295Z","bundle_sha256":"92417bb4e6d8417daeda01fb3a46e5ca7f83fc93fb31f05fa8c54bf6715f201c"}}