{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:B6MHEUYB63ZGDS2KOJZG7BUXUJ","short_pith_number":"pith:B6MHEUYB","schema_version":"1.0","canonical_sha256":"0f98725301f6f261cb4a72726f8697a24d04804e3a3ff0bf394283013427a5d0","source":{"kind":"arxiv","id":"2210.05700","version":1},"attestation_state":"computed","paper":{"title":"Multi-purpose Pickup and Delivery Problem for Combined Passenger and Freight Transport","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Erik Jenelius, Gy\\H{o}z\\H{o} Gid\\'ofalvi, Jonas Hatzenb\\\"uhler, Oded Cats","submitted_at":"2022-10-11T18:01:44Z","abstract_excerpt":"Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the multi-purpose pickup and delivery problem, where multi-purpose vehicles are assigned to serve a multi-commodity flow. We solve a series of use case scenarios using an exact optimization algorithm and an adaptive large neighborhood search algorithm. We compare the performance of a multi-purpose vehicle fleet to a mixed single-use vehicle fleet. Our findings suggest that"},"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":"2210.05700","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2022-10-11T18:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"55e7889648f8b97b62eca55fb5a64bd114d9d348422ca15be294024d09f7c09a","abstract_canon_sha256":"039269062b09ebea7059a1844be2edf62015447fb1332c068f0e54a114f313a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:05:51.909760Z","signature_b64":"EuP1IM4gLfihnTL1eAserADr1oCuClUh3uFeeCJ8PFHcVI2MLSW59TFby4wwzXxuf+EvvFU/cYpqaMeSkQVGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f98725301f6f261cb4a72726f8697a24d04804e3a3ff0bf394283013427a5d0","last_reissued_at":"2026-07-05T05:05:51.909353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:05:51.909353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-purpose Pickup and Delivery Problem for Combined Passenger and Freight Transport","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Erik Jenelius, Gy\\H{o}z\\H{o} Gid\\'ofalvi, Jonas Hatzenb\\\"uhler, Oded Cats","submitted_at":"2022-10-11T18:01:44Z","abstract_excerpt":"Recent developments in modular transport vehicles allow deploying multi-purpose vehicles which can alternately transport different kinds of flows. In this study, we propose a novel variant of the pickup and delivery problem, the multi-purpose pickup and delivery problem, where multi-purpose vehicles are assigned to serve a multi-commodity flow. We solve a series of use case scenarios using an exact optimization algorithm and an adaptive large neighborhood search algorithm. We compare the performance of a multi-purpose vehicle fleet to a mixed single-use vehicle fleet. Our findings suggest that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.05700","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.05700/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.05700","created_at":"2026-07-05T05:05:51.909417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.05700v1","created_at":"2026-07-05T05:05:51.909417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.05700","created_at":"2026-07-05T05:05:51.909417+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6MHEUYB63ZG","created_at":"2026-07-05T05:05:51.909417+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6MHEUYB63ZGDS2K","created_at":"2026-07-05T05:05:51.909417+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6MHEUYB","created_at":"2026-07-05T05:05:51.909417+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/B6MHEUYB63ZGDS2KOJZG7BUXUJ","json":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ.json","graph_json":"https://pith.science/api/pith-number/B6MHEUYB63ZGDS2KOJZG7BUXUJ/graph.json","events_json":"https://pith.science/api/pith-number/B6MHEUYB63ZGDS2KOJZG7BUXUJ/events.json","paper":"https://pith.science/paper/B6MHEUYB"},"agent_actions":{"view_html":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ","download_json":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ.json","view_paper":"https://pith.science/paper/B6MHEUYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.05700&json=true","fetch_graph":"https://pith.science/api/pith-number/B6MHEUYB63ZGDS2KOJZG7BUXUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/B6MHEUYB63ZGDS2KOJZG7BUXUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ/action/storage_attestation","attest_author":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ/action/author_attestation","sign_citation":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ/action/citation_signature","submit_replication":"https://pith.science/pith/B6MHEUYB63ZGDS2KOJZG7BUXUJ/action/replication_record"}},"created_at":"2026-07-05T05:05:51.909417+00:00","updated_at":"2026-07-05T05:05:51.909417+00:00"}