{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OSXLV2OP4O7NEEAJQTDRBWHRH2","short_pith_number":"pith:OSXLV2OP","schema_version":"1.0","canonical_sha256":"74aebae9cfe3bed2100984c710d8f13ea20372808710d08395b6c47fe87700cc","source":{"kind":"arxiv","id":"1802.06318","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.06318","created_at":"2026-05-18T00:23:03.657833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06318v1","created_at":"2026-05-18T00:23:03.657833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06318","created_at":"2026-05-18T00:23:03.657833+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSXLV2OP4O7N","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSXLV2OP4O7NEEAJ","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSXLV2OP","created_at":"2026-05-18T12:32:43.782077+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/OSXLV2OP4O7NEEAJQTDRBWHRH2","json":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2.json","graph_json":"https://pith.science/api/pith-number/OSXLV2OP4O7NEEAJQTDRBWHRH2/graph.json","events_json":"https://pith.science/api/pith-number/OSXLV2OP4O7NEEAJQTDRBWHRH2/events.json","paper":"https://pith.science/paper/OSXLV2OP"},"agent_actions":{"view_html":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2","download_json":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2.json","view_paper":"https://pith.science/paper/OSXLV2OP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06318&json=true","fetch_graph":"https://pith.science/api/pith-number/OSXLV2OP4O7NEEAJQTDRBWHRH2/graph.json","fetch_events":"https://pith.science/api/pith-number/OSXLV2OP4O7NEEAJQTDRBWHRH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/action/storage_attestation","attest_author":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/action/author_attestation","sign_citation":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/action/citation_signature","submit_replication":"https://pith.science/pith/OSXLV2OP4O7NEEAJQTDRBWHRH2/action/replication_record"}},"created_at":"2026-05-18T00:23:03.657833+00:00","updated_at":"2026-05-18T00:23:03.657833+00:00"}