{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TKBELRMKIFP4NHAOHOEAUEMRY6","short_pith_number":"pith:TKBELRMK","schema_version":"1.0","canonical_sha256":"9a8245c58a415fc69c0e3b880a1191c7b9e0761616e39aea26441ad22b6eb301","source":{"kind":"arxiv","id":"2310.18388","version":2},"attestation_state":"computed","paper":{"title":"Last Truck Scheduling for Middle-mile Next-day Delivery Coverage","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Iosifidis, Georgios Paschos, Konstantinos Benidis, Martin Gross","submitted_at":"2023-10-27T10:32:12Z","abstract_excerpt":"We consider an e-commerce retailer operating a supply chain that consists of middle- and last-mile transportation, and study its ability to deliver products stored in warehouses within a day from customer's order time. Successful next-day delivery requires inventory availability and timely truck schedules in the middle-mile and in this paper we assume a fixed inventory position and focus on optimizing the middle-mile last truck schedule. We formulate a novel optimization problem which decides the departure of the last truck at each (potential) network connection in order to maximize the number"},"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":"2310.18388","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-10-27T10:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"55bcf5cddab180d3a042638b2c150147a011ca3605b1bad88f43eace7001e132","abstract_canon_sha256":"c88b500122dffd382c91ebd4b81ab6de3086d272b4c518ca6f9a9da139adb532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:03.334251Z","signature_b64":"WKdboKwPYObnC+n85FTzkwhNiIx8TFqZmJUTKHtNiwlGAVaoq3quh0HOBTCusij+fp0J2awP0xqvMIongw41Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a8245c58a415fc69c0e3b880a1191c7b9e0761616e39aea26441ad22b6eb301","last_reissued_at":"2026-07-05T10:51:03.333786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:03.333786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Last Truck Scheduling for Middle-mile Next-day Delivery Coverage","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"George Iosifidis, Georgios Paschos, Konstantinos Benidis, Martin Gross","submitted_at":"2023-10-27T10:32:12Z","abstract_excerpt":"We consider an e-commerce retailer operating a supply chain that consists of middle- and last-mile transportation, and study its ability to deliver products stored in warehouses within a day from customer's order time. Successful next-day delivery requires inventory availability and timely truck schedules in the middle-mile and in this paper we assume a fixed inventory position and focus on optimizing the middle-mile last truck schedule. We formulate a novel optimization problem which decides the departure of the last truck at each (potential) network connection in order to maximize the number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18388","kind":"arxiv","version":2},"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/2310.18388/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":"2310.18388","created_at":"2026-07-05T10:51:03.333843+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18388v2","created_at":"2026-07-05T10:51:03.333843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18388","created_at":"2026-07-05T10:51:03.333843+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKBELRMKIFP4","created_at":"2026-07-05T10:51:03.333843+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKBELRMKIFP4NHAO","created_at":"2026-07-05T10:51:03.333843+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKBELRMK","created_at":"2026-07-05T10:51:03.333843+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20216","citing_title":"Speed-Aware Network Design: A Parametric Optimization Approach","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6","json":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6.json","graph_json":"https://pith.science/api/pith-number/TKBELRMKIFP4NHAOHOEAUEMRY6/graph.json","events_json":"https://pith.science/api/pith-number/TKBELRMKIFP4NHAOHOEAUEMRY6/events.json","paper":"https://pith.science/paper/TKBELRMK"},"agent_actions":{"view_html":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6","download_json":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6.json","view_paper":"https://pith.science/paper/TKBELRMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18388&json=true","fetch_graph":"https://pith.science/api/pith-number/TKBELRMKIFP4NHAOHOEAUEMRY6/graph.json","fetch_events":"https://pith.science/api/pith-number/TKBELRMKIFP4NHAOHOEAUEMRY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6/action/storage_attestation","attest_author":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6/action/author_attestation","sign_citation":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6/action/citation_signature","submit_replication":"https://pith.science/pith/TKBELRMKIFP4NHAOHOEAUEMRY6/action/replication_record"}},"created_at":"2026-07-05T10:51:03.333843+00:00","updated_at":"2026-07-05T10:51:03.333843+00:00"}