{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PNB373KVJ6QSIEDDIBS54OA6DN","short_pith_number":"pith:PNB373KV","schema_version":"1.0","canonical_sha256":"7b43bfed554fa12410634065de381e1b7968c8595630a66111de0aadea58a85e","source":{"kind":"arxiv","id":"1401.6483","version":1},"attestation_state":"computed","paper":{"title":"Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Lim, Hu Qin, Wenbin Zhu, Zhixin Luo","submitted_at":"2014-01-25T01:38:49Z","abstract_excerpt":"This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weight-related cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time windows. The travel cost per unit distance is a linear function of the vehicle weight and the customer demand can be fulfilled by multiple vehicles. To solve this problem, we propose a exact branch-and-"},"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":"1401.6483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-25T01:38:49Z","cross_cats_sorted":[],"title_canon_sha256":"fd21120c914983cb2a192c789d0f489d35fad06308775d09a1d0a03abf22afa8","abstract_canon_sha256":"e892fba4155fe209d2c91d4b120fcad1c523166c181b9b8fc57e2ff91bf06d89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.667118Z","signature_b64":"VRLZfZifDDoyyBYtwuZd1WuseL+E5AOpLcS3YAT19Ly0L+6icBvgJH3fsVI7/6ACP2oomscuEwAHMegnW4s2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b43bfed554fa12410634065de381e1b7968c8595630a66111de0aadea58a85e","last_reissued_at":"2026-05-18T03:01:01.666334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.666334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Lim, Hu Qin, Wenbin Zhu, Zhixin Luo","submitted_at":"2014-01-25T01:38:49Z","abstract_excerpt":"This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weight-related cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time windows. The travel cost per unit distance is a linear function of the vehicle weight and the customer demand can be fulfilled by multiple vehicles. To solve this problem, we propose a exact branch-and-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6483","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":"1401.6483","created_at":"2026-05-18T03:01:01.666469+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6483v1","created_at":"2026-05-18T03:01:01.666469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6483","created_at":"2026-05-18T03:01:01.666469+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNB373KVJ6QS","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNB373KVJ6QSIEDD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNB373KV","created_at":"2026-05-18T12:28:43.426989+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/PNB373KVJ6QSIEDDIBS54OA6DN","json":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN.json","graph_json":"https://pith.science/api/pith-number/PNB373KVJ6QSIEDDIBS54OA6DN/graph.json","events_json":"https://pith.science/api/pith-number/PNB373KVJ6QSIEDDIBS54OA6DN/events.json","paper":"https://pith.science/paper/PNB373KV"},"agent_actions":{"view_html":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN","download_json":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN.json","view_paper":"https://pith.science/paper/PNB373KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6483&json=true","fetch_graph":"https://pith.science/api/pith-number/PNB373KVJ6QSIEDDIBS54OA6DN/graph.json","fetch_events":"https://pith.science/api/pith-number/PNB373KVJ6QSIEDDIBS54OA6DN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN/action/storage_attestation","attest_author":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN/action/author_attestation","sign_citation":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN/action/citation_signature","submit_replication":"https://pith.science/pith/PNB373KVJ6QSIEDDIBS54OA6DN/action/replication_record"}},"created_at":"2026-05-18T03:01:01.666469+00:00","updated_at":"2026-05-18T03:01:01.666469+00:00"}