{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NUHBZGMV765ZWZARFSH3MRUEVX","short_pith_number":"pith:NUHBZGMV","canonical_record":{"source":{"id":"1404.6696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-26T23:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"449ce19368d60d2b1583f8ca1b67b3a8a4bd3c16fff370289d99a4b205cd78d8","abstract_canon_sha256":"c536a24d28e834abeb43a7c11b83b11766cd1dc309a95383b3e332d274bf0bc6"},"schema_version":"1.0"},"canonical_sha256":"6d0e1c9995ffbb9b64112c8fb64684adda62686b584804b4673d84d86ba4b358","source":{"kind":"arxiv","id":"1404.6696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6696","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6696v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6696","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"NUHBZGMV765Z","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NUHBZGMV765ZWZAR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NUHBZGMV","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NUHBZGMV765ZWZARFSH3MRUEVX","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-26T23:52:47Z","cross_cats_sorted":[],"title_canon_sha256":"449ce19368d60d2b1583f8ca1b67b3a8a4bd3c16fff370289d99a4b205cd78d8","abstract_canon_sha256":"c536a24d28e834abeb43a7c11b83b11766cd1dc309a95383b3e332d274bf0bc6"},"schema_version":"1.0"},"canonical_sha256":"6d0e1c9995ffbb9b64112c8fb64684adda62686b584804b4673d84d86ba4b358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:06.265293Z","signature_b64":"uOJUpb/0JW+qct/9v7QrU5pWomF+lAe/i21tUd6PWfDZNXxurnRklbH5sVVfzjPF/N2H3Sf6RJHQebCAhaCAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0e1c9995ffbb9b64112c8fb64684adda62686b584804b4673d84d86ba4b358","last_reissued_at":"2026-05-18T02:53:06.264646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:06.264646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6696","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-05-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9eKOJIArO0cmexw6CPE2cYEgGphhS0gmvWK2Lqs88d3ZA/L+ilGVfJ4SmiLvJwU+KgAJm5O27k7YoP3CiUfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:46:42.045851Z"},"content_sha256":"5dd4902a485715fa2faea23078cd3bd5e5dd8fb5e7d42513dbb711ad48133063","schema_version":"1.0","event_id":"sha256:5dd4902a485715fa2faea23078cd3bd5e5dd8fb5e7d42513dbb711ad48133063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NUHBZGMV765ZWZARFSH3MRUEVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Metaheuristics for the Clustered Vehicle Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anand Subramanian, G\\\"une\\c{s} Erdo\\v{g}an, Maria Battarra, Thibaut Vidal","submitted_at":"2014-04-26T23:52:47Z","abstract_excerpt":"The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This article presents two alternative hybrid metaheuristic algorithms for the CluVRP. The first algorithm is based on an Iterated Local Search algorithm, in which only feasible solutions are explored and problem-specific local search moves are utilized. The second algorithm is a Hybrid Genetic Search, for which the shortest "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6696","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":""},"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-18T02:53:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rNrUVoPyivfuCB4jCslaUiotWhC47EX9ILCo0ccj0lCftdzC8szrWsw+OUENRlsZH9RAtyYyJvMucBWQ8x9ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:46:42.046562Z"},"content_sha256":"beedbdf06421becafa82e9c44d04b164f4c707ec40462eaaacac55ec38a58a47","schema_version":"1.0","event_id":"sha256:beedbdf06421becafa82e9c44d04b164f4c707ec40462eaaacac55ec38a58a47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NUHBZGMV765ZWZARFSH3MRUEVX/bundle.json","state_url":"https://pith.science/pith/NUHBZGMV765ZWZARFSH3MRUEVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NUHBZGMV765ZWZARFSH3MRUEVX/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-26T00:46:42Z","links":{"resolver":"https://pith.science/pith/NUHBZGMV765ZWZARFSH3MRUEVX","bundle":"https://pith.science/pith/NUHBZGMV765ZWZARFSH3MRUEVX/bundle.json","state":"https://pith.science/pith/NUHBZGMV765ZWZARFSH3MRUEVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NUHBZGMV765ZWZARFSH3MRUEVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NUHBZGMV765ZWZARFSH3MRUEVX","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":"c536a24d28e834abeb43a7c11b83b11766cd1dc309a95383b3e332d274bf0bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-26T23:52:47Z","title_canon_sha256":"449ce19368d60d2b1583f8ca1b67b3a8a4bd3c16fff370289d99a4b205cd78d8"},"schema_version":"1.0","source":{"id":"1404.6696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6696","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6696v1","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6696","created_at":"2026-05-18T02:53:06Z"},{"alias_kind":"pith_short_12","alias_value":"NUHBZGMV765Z","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NUHBZGMV765ZWZAR","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NUHBZGMV","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:beedbdf06421becafa82e9c44d04b164f4c707ec40462eaaacac55ec38a58a47","target":"graph","created_at":"2026-05-18T02:53:06Z","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 Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This article presents two alternative hybrid metaheuristic algorithms for the CluVRP. The first algorithm is based on an Iterated Local Search algorithm, in which only feasible solutions are explored and problem-specific local search moves are utilized. The second algorithm is a Hybrid Genetic Search, for which the shortest ","authors_text":"Anand Subramanian, G\\\"une\\c{s} Erdo\\v{g}an, Maria Battarra, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-26T23:52:47Z","title":"Hybrid Metaheuristics for the Clustered Vehicle Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6696","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:5dd4902a485715fa2faea23078cd3bd5e5dd8fb5e7d42513dbb711ad48133063","target":"record","created_at":"2026-05-18T02:53:06Z","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":"c536a24d28e834abeb43a7c11b83b11766cd1dc309a95383b3e332d274bf0bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-04-26T23:52:47Z","title_canon_sha256":"449ce19368d60d2b1583f8ca1b67b3a8a4bd3c16fff370289d99a4b205cd78d8"},"schema_version":"1.0","source":{"id":"1404.6696","kind":"arxiv","version":1}},"canonical_sha256":"6d0e1c9995ffbb9b64112c8fb64684adda62686b584804b4673d84d86ba4b358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d0e1c9995ffbb9b64112c8fb64684adda62686b584804b4673d84d86ba4b358","first_computed_at":"2026-05-18T02:53:06.264646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:06.264646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uOJUpb/0JW+qct/9v7QrU5pWomF+lAe/i21tUd6PWfDZNXxurnRklbH5sVVfzjPF/N2H3Sf6RJHQebCAhaCAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:06.265293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dd4902a485715fa2faea23078cd3bd5e5dd8fb5e7d42513dbb711ad48133063","sha256:beedbdf06421becafa82e9c44d04b164f4c707ec40462eaaacac55ec38a58a47"],"state_sha256":"eb877481b1c62ae50d23145af709e05ef299b08bf1d4fbeff415ce1f5cd695b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezsO1RsXS0IgpLZ1HYe0suOFfjlBrq7lNLjMMqNQQMx33p+PS+dFJaPhVuWr2N38dpT685qDn5dh77jE3XYEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:46:42.050231Z","bundle_sha256":"18bff5a624f56be8ba55569f78b868d298351259659cb95e6f0dd7f4751784e4"}}