{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7JZSI3D34X2RE3CH2Y7OBIGD56","short_pith_number":"pith:7JZSI3D3","canonical_record":{"source":{"id":"1401.3794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T23:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"47fc407242c9bf64dd949e88d571016c6ffb1e67f31ff091bf721814842a3318","abstract_canon_sha256":"83cee11148ae8f677687ba5c6d0e95c65aaa5b11720e9c0bfccec9fe7ccd9e75"},"schema_version":"1.0"},"canonical_sha256":"fa73246c7be5f5126c47d63ee0a0c3ef9023892dc801b322e5d6457e5723f6bd","source":{"kind":"arxiv","id":"1401.3794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3794","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3794v2","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3794","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"7JZSI3D34X2R","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7JZSI3D34X2RE3CH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7JZSI3D3","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7JZSI3D34X2RE3CH2Y7OBIGD56","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3794","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T23:47:21Z","cross_cats_sorted":[],"title_canon_sha256":"47fc407242c9bf64dd949e88d571016c6ffb1e67f31ff091bf721814842a3318","abstract_canon_sha256":"83cee11148ae8f677687ba5c6d0e95c65aaa5b11720e9c0bfccec9fe7ccd9e75"},"schema_version":"1.0"},"canonical_sha256":"fa73246c7be5f5126c47d63ee0a0c3ef9023892dc801b322e5d6457e5723f6bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:31.005130Z","signature_b64":"ay4J6L5XpFOv0NUCt8Rhz2rqDpJbC9YTQEtU6oatgfptK07eve3rnezDKTlCZQCXRoUfYmoN7VzaJ5MnSPSfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa73246c7be5f5126c47d63ee0a0c3ef9023892dc801b322e5d6457e5723f6bd","last_reissued_at":"2026-05-18T02:46:31.004724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:31.004724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3794","source_version":2,"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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqTard4Sflrcw7O/w/atoQ9c9sZPE8R5RNZKXoCqkEHz76YWoz4lysjgmdkLgFz4iwMH0Jp7IbPyKlYebFQgBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:02.312100Z"},"content_sha256":"497cc36ea74f34b288c50364e5b48103f76d48767b23500c8fcb7aa4904a3a09","schema_version":"1.0","event_id":"sha256:497cc36ea74f34b288c50364e5b48103f76d48767b23500c8fcb7aa4904a3a09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7JZSI3D34X2RE3CH2Y7OBIGD56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large neighborhoods with implicit customer selection for vehicle routing problems with profits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Luis Satoru Ochi, Nelson Maculan, Puca Huachi Vaz Penna, Thibaut Vidal","submitted_at":"2014-01-15T23:47:21Z","abstract_excerpt":"We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under capacity constraints. Finally, in the VRP with private fleet and common carrier, some customers can be delegated to an external carrier subject to a cost. Three families of combined decisions must be ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3794","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":""},"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:46:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Kn1chz93t5SGFsXyIX8voXJ+qFDuauq5eB9WITLH6O5VsDFvrEQefn0hYMx8bgkQMFmp43J+CU4M5ZisA0lBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:02.312495Z"},"content_sha256":"669d9285b1369c8280a410d063dde95519dfbd06afce44e6429135dda6463c29","schema_version":"1.0","event_id":"sha256:669d9285b1369c8280a410d063dde95519dfbd06afce44e6429135dda6463c29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/bundle.json","state_url":"https://pith.science/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/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-25T20:11:02Z","links":{"resolver":"https://pith.science/pith/7JZSI3D34X2RE3CH2Y7OBIGD56","bundle":"https://pith.science/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/bundle.json","state":"https://pith.science/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JZSI3D34X2RE3CH2Y7OBIGD56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7JZSI3D34X2RE3CH2Y7OBIGD56","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":"83cee11148ae8f677687ba5c6d0e95c65aaa5b11720e9c0bfccec9fe7ccd9e75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T23:47:21Z","title_canon_sha256":"47fc407242c9bf64dd949e88d571016c6ffb1e67f31ff091bf721814842a3318"},"schema_version":"1.0","source":{"id":"1401.3794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3794","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3794v2","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3794","created_at":"2026-05-18T02:46:31Z"},{"alias_kind":"pith_short_12","alias_value":"7JZSI3D34X2R","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7JZSI3D34X2RE3CH","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7JZSI3D3","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:669d9285b1369c8280a410d063dde95519dfbd06afce44e6429135dda6463c29","target":"graph","created_at":"2026-05-18T02:46:31Z","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":"We consider several Vehicle Routing Problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under capacity constraints. Finally, in the VRP with private fleet and common carrier, some customers can be delegated to an external carrier subject to a cost. Three families of combined decisions must be ta","authors_text":"Luis Satoru Ochi, Nelson Maculan, Puca Huachi Vaz Penna, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T23:47:21Z","title":"Large neighborhoods with implicit customer selection for vehicle routing problems with profits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3794","kind":"arxiv","version":2},"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:497cc36ea74f34b288c50364e5b48103f76d48767b23500c8fcb7aa4904a3a09","target":"record","created_at":"2026-05-18T02:46:31Z","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":"83cee11148ae8f677687ba5c6d0e95c65aaa5b11720e9c0bfccec9fe7ccd9e75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-15T23:47:21Z","title_canon_sha256":"47fc407242c9bf64dd949e88d571016c6ffb1e67f31ff091bf721814842a3318"},"schema_version":"1.0","source":{"id":"1401.3794","kind":"arxiv","version":2}},"canonical_sha256":"fa73246c7be5f5126c47d63ee0a0c3ef9023892dc801b322e5d6457e5723f6bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa73246c7be5f5126c47d63ee0a0c3ef9023892dc801b322e5d6457e5723f6bd","first_computed_at":"2026-05-18T02:46:31.004724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:31.004724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ay4J6L5XpFOv0NUCt8Rhz2rqDpJbC9YTQEtU6oatgfptK07eve3rnezDKTlCZQCXRoUfYmoN7VzaJ5MnSPSfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:31.005130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:497cc36ea74f34b288c50364e5b48103f76d48767b23500c8fcb7aa4904a3a09","sha256:669d9285b1369c8280a410d063dde95519dfbd06afce44e6429135dda6463c29"],"state_sha256":"bc56498fdf699595e5adda28de229b2c12c0739b206241687b4207d82c2e505a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7CW0OCxyyKV32jgquKvXJb9wjSVDtqTY2U2z1k+rU1G/yE0RKI6XwEf8AeFVH6Zc/kmmigc04JSIm1ueDJC0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:11:02.315878Z","bundle_sha256":"d463a74fb9e87d13f2e1cd9f7a00248f8dcb91762ea401c6122b7af1aa1dff27"}}