{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZAWXPTSALD6ZKS2PJ64W43OKEB","short_pith_number":"pith:ZAWXPTSA","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"},"canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","source":{"kind":"arxiv","id":"1508.02759","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02759","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02759v3","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02759","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZAWXPTSALD6Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAWXPTSALD6ZKS2P","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAWXPTSA","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZAWXPTSALD6ZKS2PJ64W43OKEB","target":"record","payload":{"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"},"canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","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"},"source_kind":"arxiv","source_id":"1508.02759","source_version":3,"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-05-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G+Dp3LgB2xCt+vkMKdhbS4xi9wxIclLn/LSQuB8nqTHeKV5wIyNVscjpEdzhoHNIeuCqAgi9cB0ZSHqWLh+RCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:10.035988Z"},"content_sha256":"02832abd6dcf27bd644019b646a34c0e336937136bf7519ed7f7dd8ebcda2418","schema_version":"1.0","event_id":"sha256:02832abd6dcf27bd644019b646a34c0e336937136bf7519ed7f7dd8ebcda2418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZAWXPTSALD6ZKS2PJ64W43OKEB","target":"graph","payload":{"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"},"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-05-18T00:16:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hQ3Z0T14+sItzXFpjjwQUJQ4QwxH94WJcRlhFFEn1SWuSkh7hVW8VmoWouwrdpL7Uzq0KchSoNXC4PSA7zpPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:10.036514Z"},"content_sha256":"32b08b37fbc4306b1df5bfa81d70af11ae90de9a9263ce72015c8b62a9016916","schema_version":"1.0","event_id":"sha256:32b08b37fbc4306b1df5bfa81d70af11ae90de9a9263ce72015c8b62a9016916"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/bundle.json","state_url":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/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-05-26T10:45:10Z","links":{"resolver":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB","bundle":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/bundle.json","state":"https://pith.science/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZAWXPTSALD6ZKS2PJ64W43OKEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZAWXPTSALD6ZKS2PJ64W43OKEB","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":"0476222c7ee4ff62ff6e8fcc5ee7211394dcb36ab7dcbc90c2b834896449af41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T21:41:37Z","title_canon_sha256":"2e09c9d71f042f0586da473271c24ab45bc7a2a43d2cf13fcbe5b44540356d1e"},"schema_version":"1.0","source":{"id":"1508.02759","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02759","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02759v3","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02759","created_at":"2026-05-18T00:16:46Z"},{"alias_kind":"pith_short_12","alias_value":"ZAWXPTSALD6Z","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZAWXPTSALD6ZKS2P","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZAWXPTSA","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:32b08b37fbc4306b1df5bfa81d70af11ae90de9a9263ce72015c8b62a9016916","target":"graph","created_at":"2026-05-18T00:16:46Z","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"},"paper":{"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","authors_text":"Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T21:41:37Z","title":"Technical Note: Split Algorithm in O(n) for the Capacitated Vehicle Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02759","kind":"arxiv","version":3},"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:02832abd6dcf27bd644019b646a34c0e336937136bf7519ed7f7dd8ebcda2418","target":"record","created_at":"2026-05-18T00:16:46Z","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":"0476222c7ee4ff62ff6e8fcc5ee7211394dcb36ab7dcbc90c2b834896449af41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-11T21:41:37Z","title_canon_sha256":"2e09c9d71f042f0586da473271c24ab45bc7a2a43d2cf13fcbe5b44540356d1e"},"schema_version":"1.0","source":{"id":"1508.02759","kind":"arxiv","version":3}},"canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c82d77ce4058fd954b4f4fb96e6dca206d57b4e6ae5e64744410062d6dbcd60a","first_computed_at":"2026-05-18T00:16:46.001857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:46.001857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9a2Jh7r/2hTFejLCr+qD1xNgB/JLcljx8I0g9OjQp03aXnDy7XDzkQeORKHh5ts4yIhLVpLFkxjpOAlS8KtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:46.002435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02759","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02832abd6dcf27bd644019b646a34c0e336937136bf7519ed7f7dd8ebcda2418","sha256:32b08b37fbc4306b1df5bfa81d70af11ae90de9a9263ce72015c8b62a9016916"],"state_sha256":"1ff63e5572f32d73143e4271fcf73121f6fad35b9adf2fb9aadcd8b1e76d2b37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yc1dQvRvGrip0s+NrU9Qdut0WWxyNdtsMVfMfJvhCRvayHoBkMysGz5CH6nUsmOiI2M+D1sX9aAeEwfd7AShAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:45:10.040519Z","bundle_sha256":"7c6bb1ee6bd9dd59a7e762e4222b598daf546d4c0bfa872f775dd91c430d58af"}}