{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OSXLV2OP4O7NEEAJQTDRBWHRH2","short_pith_number":"pith:OSXLV2OP","canonical_record":{"source":{"id":"1802.06318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T02:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"dd6c7c9ea64534c92bbaa4e12db62854d748a1928b5c8610f267d447f1e6ea4a","abstract_canon_sha256":"ff02f4baf8d56f21801fa260711dd7b39484e0713c831e6cafdeca7af739ef1c"},"schema_version":"1.0"},"canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","source":{"kind":"arxiv","id":"1802.06318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06318","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06318v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06318","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"OSXLV2OP4O7N","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OSXLV2OP4O7NEEAJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OSXLV2OP","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OSXLV2OP4O7NEEAJQTDRBWHRH2","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T02:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"dd6c7c9ea64534c92bbaa4e12db62854d748a1928b5c8610f267d447f1e6ea4a","abstract_canon_sha256":"ff02f4baf8d56f21801fa260711dd7b39484e0713c831e6cafdeca7af739ef1c"},"schema_version":"1.0"},"canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.658451Z","signature_b64":"f269XujUj7oG8NLecPlFC3kXKqwnL4aeEFQZvTf7wzJnakvFpCJdFbatAaPJqz3UXrso4n8Wd3rEjZO6pQgEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","last_reissued_at":"2026-05-18T00:23:03.657742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.657742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06318","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YimhrHxqMhW5Ui6SSrYSeG+gdiMZQKvuFqu8bZpjBV5XqpYmIktBInB5WzQy3jXZCWne8F4KgNM7PdbV+nZ4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:32:36.993732Z"},"content_sha256":"254d62be3830c3618b4035a9b0dedbce1052458d5a1dabaf6e5aa56927c56070","schema_version":"1.0","event_id":"sha256:254d62be3830c3618b4035a9b0dedbce1052458d5a1dabaf6e5aa56927c56070"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OSXLV2OP4O7NEEAJQTDRBWHRH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Luiz Satoru Ochi, Marcone Jamilson Freitas Souza, Matheus Nohra Haddad, Rafael Martinelli, Richard Hartl, Simone Martins, Thibaut Vidal","submitted_at":"2018-02-18T02:09:20Z","abstract_excerpt":"We consider the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, \"pickups and deliveries\" and \"split deliveries\". This possibly leads to optimal solutions of a size that grows exponentially with the instance size, containing multiple visits per customer pair, even in the same route. To solve this problem, we propose an iterated lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06318","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Q4JRd87kOU9LMe0i3MgAfNHy/p4tX10kgR0byurqXQb7ULU8dzX/J19R8lNuwuGXu9nb/ZxRQze1SPWk6MMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:32:36.994201Z"},"content_sha256":"bb21768aeac57d5d9b1d181a4c240aa76e48b8cd0bfa1ccc878db2ca9fa64ae9","schema_version":"1.0","event_id":"sha256:bb21768aeac57d5d9b1d181a4c240aa76e48b8cd0bfa1ccc878db2ca9fa64ae9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/bundle.json","state_url":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/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:32:36Z","links":{"resolver":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2","bundle":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/bundle.json","state":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OSXLV2OP4O7NEEAJQTDRBWHRH2","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":"ff02f4baf8d56f21801fa260711dd7b39484e0713c831e6cafdeca7af739ef1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T02:09:20Z","title_canon_sha256":"dd6c7c9ea64534c92bbaa4e12db62854d748a1928b5c8610f267d447f1e6ea4a"},"schema_version":"1.0","source":{"id":"1802.06318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06318","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06318v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06318","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"OSXLV2OP4O7N","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OSXLV2OP4O7NEEAJ","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OSXLV2OP","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:bb21768aeac57d5d9b1d181a4c240aa76e48b8cd0bfa1ccc878db2ca9fa64ae9","target":"graph","created_at":"2026-05-18T00:23:03Z","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 the multi-vehicle one-to-one pickup and delivery problem with split loads, a NP-hard problem linked with a variety of applications for bulk product transportation, bike-sharing systems and inventory re-balancing. This problem is notoriously difficult due to the interaction of two challenging vehicle routing attributes, \"pickups and deliveries\" and \"split deliveries\". This possibly leads to optimal solutions of a size that grows exponentially with the instance size, containing multiple visits per customer pair, even in the same route. To solve this problem, we propose an iterated lo","authors_text":"Luiz Satoru Ochi, Marcone Jamilson Freitas Souza, Matheus Nohra Haddad, Rafael Martinelli, Richard Hartl, Simone Martins, Thibaut Vidal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T02:09:20Z","title":"Large Neighborhood-Based Metaheuristic and Branch-and-Price for the Pickup and Delivery Problem with Split Loads"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06318","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:254d62be3830c3618b4035a9b0dedbce1052458d5a1dabaf6e5aa56927c56070","target":"record","created_at":"2026-05-18T00:23:03Z","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":"ff02f4baf8d56f21801fa260711dd7b39484e0713c831e6cafdeca7af739ef1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T02:09:20Z","title_canon_sha256":"dd6c7c9ea64534c92bbaa4e12db62854d748a1928b5c8610f267d447f1e6ea4a"},"schema_version":"1.0","source":{"id":"1802.06318","kind":"arxiv","version":1}},"canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","first_computed_at":"2026-05-18T00:23:03.657742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.657742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f269XujUj7oG8NLecPlFC3kXKqwnL4aeEFQZvTf7wzJnakvFpCJdFbatAaPJqz3UXrso4n8Wd3rEjZO6pQgEBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.658451Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:254d62be3830c3618b4035a9b0dedbce1052458d5a1dabaf6e5aa56927c56070","sha256:bb21768aeac57d5d9b1d181a4c240aa76e48b8cd0bfa1ccc878db2ca9fa64ae9"],"state_sha256":"4d9b5af02e67f636a20421c74acc8b9849b721192a3745ec377f4394ae11c4fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBAw/6nuiY1lIaRl8xVl94KI5T+nPsAlpqJYDNFLyczegDw9W1b/G7i5ybqZN4r/aVMRZwYPtKSEq3L3d1R/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:32:36.997885Z","bundle_sha256":"8f0804e6235902ae5f5212bdd51adbdb0e4bc9966839a9f41454c69879e14a93"}}