{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E3TMN5EKXJG5N6CTGNO7JT44US","short_pith_number":"pith:E3TMN5EK","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"},"canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","source":{"kind":"arxiv","id":"1805.05012","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05012","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05012v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05012","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"E3TMN5EKXJG5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E3TMN5EKXJG5N6CT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E3TMN5EK","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E3TMN5EKXJG5N6CTGNO7JT44US","target":"record","payload":{"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"},"canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","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"},"source_kind":"arxiv","source_id":"1805.05012","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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58+P6xzc8QSkH+XsITglAt7HQxy9tnn3ONdK8y0M/cxxCqdT6APOZi1GUc0e7bcudCpBo8SLAD0L5hM3ftWNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:25:26.877338Z"},"content_sha256":"013f915c3445a96fefadbacb38545d412b29e7f9430acc3bbdef407cb67404c3","schema_version":"1.0","event_id":"sha256:013f915c3445a96fefadbacb38545d412b29e7f9430acc3bbdef407cb67404c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E3TMN5EKXJG5N6CTGNO7JT44US","target":"graph","payload":{"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"},"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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KR/SMpdvQucEEa+ELNdpuq/XycIVpsdrskHGFhaw+tiWsrVSMSKYhxyT8QPHoB/X+/aKj/BEef2AkxT6NcQrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T22:25:26.877700Z"},"content_sha256":"93ea59861a4bdb98caa6771a0b1c9edfa37e3d1eafa7f2b94bb51c5fa354bffd","schema_version":"1.0","event_id":"sha256:93ea59861a4bdb98caa6771a0b1c9edfa37e3d1eafa7f2b94bb51c5fa354bffd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/bundle.json","state_url":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3TMN5EKXJG5N6CTGNO7JT44US/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-06-01T22:25:26Z","links":{"resolver":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US","bundle":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/bundle.json","state":"https://pith.science/pith/E3TMN5EKXJG5N6CTGNO7JT44US/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3TMN5EKXJG5N6CTGNO7JT44US/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E3TMN5EKXJG5N6CTGNO7JT44US","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":"9a5b265f7df11bc8b388dac8898b4a7d5254632502c359b902477b100abf3ab6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-14T05:06:04Z","title_canon_sha256":"489aac3a40d49910a460d9f166b51e7aa6dcfc13a5cc30b156695d55adaddd8d"},"schema_version":"1.0","source":{"id":"1805.05012","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05012","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05012v1","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05012","created_at":"2026-05-18T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"E3TMN5EKXJG5","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E3TMN5EKXJG5N6CT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E3TMN5EK","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:93ea59861a4bdb98caa6771a0b1c9edfa37e3d1eafa7f2b94bb51c5fa354bffd","target":"graph","created_at":"2026-05-18T00:16:04Z","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 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","authors_text":"Junyu Cao, Mariana Olvera-Cravioto, Zuo-Jun Shen","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-14T05:06:04Z","title":"Last-mile shared delivery: A discrete sequential packing approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05012","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:013f915c3445a96fefadbacb38545d412b29e7f9430acc3bbdef407cb67404c3","target":"record","created_at":"2026-05-18T00:16:04Z","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":"9a5b265f7df11bc8b388dac8898b4a7d5254632502c359b902477b100abf3ab6","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-05-14T05:06:04Z","title_canon_sha256":"489aac3a40d49910a460d9f166b51e7aa6dcfc13a5cc30b156695d55adaddd8d"},"schema_version":"1.0","source":{"id":"1805.05012","kind":"arxiv","version":1}},"canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26e6c6f48aba4dd6f853335df4cf9ca492fa4a81c91fe3d5ae9cc5c08e896169","first_computed_at":"2026-05-18T00:16:04.073117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:04.073117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KaZ4TEGxsKKeYCwfIZv69e9dhzsyEQ4MCz45J9Flfq22JZ2+PAHiOeXuq8k1Hlw2TE0sxXMPsJADuU/IBF6xCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:04.073482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05012","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013f915c3445a96fefadbacb38545d412b29e7f9430acc3bbdef407cb67404c3","sha256:93ea59861a4bdb98caa6771a0b1c9edfa37e3d1eafa7f2b94bb51c5fa354bffd"],"state_sha256":"c44850e7f69f430a4674649a2139bd437ba39569d228e1e1c461312dcac9c001"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2sDgNgqQbW/XNnZ9kzCQZy7K3FMjF11qyViMPYzgJCWfIMXxTAFo1syHbI6Gvj34MOCsADgV98w/hT6+cMRMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T22:25:26.879672Z","bundle_sha256":"f754b98da863cc8900abc24a3a4b61c15a366ce5b828e12462270e05d605d365"}}