{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZAWXPTSALD6ZKS2PJ64W43OKEB","short_pith_number":"pith:ZAWXPTSA","schema_version":"1.0","canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","source":{"kind":"arxiv","id":"1508.02759","version":3},"attestation_state":"computed","paper":{"title":"Technical Note: Split Algorithm in O(n) for the Capacitated Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thibaut Vidal","submitted_at":"2015-08-11T21:41:37Z","abstract_excerpt":"The Split algorithm is an essential building block of route-first cluster-second heuristics and modern genetic algorithms for vehicle routing problems. The algorithm is used to partition a solution, represented as a giant tour without occurrences of the depot, into separate routes with minimum cost. As highlighted by the recent survey of [Prins, Lacomme and Prodhon, Transport Res. C (40), 179-200], no less than 70 recent articles use this technique. In the vehicle routing literature, Split is usually assimilated to the search for a shortest path in a directed acyclic graph $\\mathcal{G}$ and so"},"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":"1508.02759","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T21:41:37Z","cross_cats_sorted":[],"title_canon_sha256":"2e09c9d71f042f0586da473271c24ab45bc7a2a43d2cf13fcbe5b44540356d1e","abstract_canon_sha256":"0476222c7ee4ff62ff6e8fcc5ee7211394dcb36ab7dcbc90c2b834896449af41"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:46.002435Z","signature_b64":"p9a2Jh7r/2hTFejLCr+qD1xNgB/JLcljx8I0g9OjQp03aXnDy7XDzkQeORKHh5ts4yIhLVpLFkxjpOAlS8KtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","last_reissued_at":"2026-05-18T00:16:46.001857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:46.001857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Note: Split Algorithm in O(n) for the Capacitated Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Thibaut Vidal","submitted_at":"2015-08-11T21:41:37Z","abstract_excerpt":"The Split algorithm is an essential building block of route-first cluster-second heuristics and modern genetic algorithms for vehicle routing problems. The algorithm is used to partition a solution, represented as a giant tour without occurrences of the depot, into separate routes with minimum cost. As highlighted by the recent survey of [Prins, Lacomme and Prodhon, Transport Res. C (40), 179-200], no less than 70 recent articles use this technique. In the vehicle routing literature, Split is usually assimilated to the search for a shortest path in a directed acyclic graph $\\mathcal{G}$ and so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02759","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1508.02759","created_at":"2026-05-18T00:16:46.001955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02759v3","created_at":"2026-05-18T00:16:46.001955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02759","created_at":"2026-05-18T00:16:46.001955+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZAWXPTSALD6Z","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZAWXPTSALD6ZKS2P","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZAWXPTSA","created_at":"2026-05-18T12:29:52.810259+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/ZAWXPTSALD6ZKS2PJ64W43OKEB","json":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB.json","graph_json":"https://pith.science/api/pith-number/ZAWXPTSALD6ZKS2PJ64W43OKEB/graph.json","events_json":"https://pith.science/api/pith-number/ZAWXPTSALD6ZKS2PJ64W43OKEB/events.json","paper":"https://pith.science/paper/ZAWXPTSA"},"agent_actions":{"view_html":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB","download_json":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB.json","view_paper":"https://pith.science/paper/ZAWXPTSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02759&json=true","fetch_graph":"https://pith.science/api/pith-number/ZAWXPTSALD6ZKS2PJ64W43OKEB/graph.json","fetch_events":"https://pith.science/api/pith-number/ZAWXPTSALD6ZKS2PJ64W43OKEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/action/storage_attestation","attest_author":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/action/author_attestation","sign_citation":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/action/citation_signature","submit_replication":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/action/replication_record"}},"created_at":"2026-05-18T00:16:46.001955+00:00","updated_at":"2026-05-18T00:16:46.001955+00:00"}