{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:E3TMN5EKXJG5N6CTGNO7JT44US","short_pith_number":"pith:E3TMN5EK","schema_version":"1.0","canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","source":{"kind":"arxiv","id":"1805.05012","version":1},"attestation_state":"computed","paper":{"title":"Last-mile shared delivery: A discrete sequential packing approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Junyu Cao, Mariana Olvera-Cravioto, Zuo-Jun Shen","submitted_at":"2018-05-14T05:06:04Z","abstract_excerpt":"We propose a model for optimizing the last-mile delivery of n packages, from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g., Uber or Lyft) with traditional in-house van delivery systems. The main objective is to compute the optimal reward offered to private drivers for each of the n packages, such that the total expected cost of delivering all packages is minimized. Our technical approach is based on the formulation of a discrete sequential packing problem, where bundles of packages are picked up from the warehouse at ran"},"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":"1805.05012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-14T05:06:04Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"489aac3a40d49910a460d9f166b51e7aa6dcfc13a5cc30b156695d55adaddd8d","abstract_canon_sha256":"9a5b265f7df11bc8b388dac8898b4a7d5254632502c359b902477b100abf3ab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:04.073482Z","signature_b64":"KaZ4TEGxsKKeYCwfIZv69e9dhzsyEQ4MCz45J9Flfq22JZ2+PAHiOeXuq8k1Hlw2TE0sxXMPsJADuU/IBF6xCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","last_reissued_at":"2026-05-18T00:16:04.073117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:04.073117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Last-mile shared delivery: A discrete sequential packing approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Junyu Cao, Mariana Olvera-Cravioto, Zuo-Jun Shen","submitted_at":"2018-05-14T05:06:04Z","abstract_excerpt":"We propose a model for optimizing the last-mile delivery of n packages, from a distribution center to their final recipients, using a strategy that combines the use of ride-sharing platforms (e.g., Uber or Lyft) with traditional in-house van delivery systems. The main objective is to compute the optimal reward offered to private drivers for each of the n packages, such that the total expected cost of delivering all packages is minimized. Our technical approach is based on the formulation of a discrete sequential packing problem, where bundles of packages are picked up from the warehouse at ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05012","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":"1805.05012","created_at":"2026-05-18T00:16:04.073172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.05012v1","created_at":"2026-05-18T00:16:04.073172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05012","created_at":"2026-05-18T00:16:04.073172+00:00"},{"alias_kind":"pith_short_12","alias_value":"E3TMN5EKXJG5","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"E3TMN5EKXJG5N6CT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"E3TMN5EK","created_at":"2026-05-18T12:32:19.392346+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/E3TMN5EKXJG5N6CTGNO7JT44US","json":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US.json","graph_json":"https://pith.science/api/pith-number/E3TMN5EKXJG5N6CTGNO7JT44US/graph.json","events_json":"https://pith.science/api/pith-number/E3TMN5EKXJG5N6CTGNO7JT44US/events.json","paper":"https://pith.science/paper/E3TMN5EK"},"agent_actions":{"view_html":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US","download_json":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US.json","view_paper":"https://pith.science/paper/E3TMN5EK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.05012&json=true","fetch_graph":"https://pith.science/api/pith-number/E3TMN5EKXJG5N6CTGNO7JT44US/graph.json","fetch_events":"https://pith.science/api/pith-number/E3TMN5EKXJG5N6CTGNO7JT44US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/action/storage_attestation","attest_author":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/action/author_attestation","sign_citation":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/action/citation_signature","submit_replication":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/action/replication_record"}},"created_at":"2026-05-18T00:16:04.073172+00:00","updated_at":"2026-05-18T00:16:04.073172+00:00"}