{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6IWOAK6NAYAZS6GQLCCOFLLHU7","short_pith_number":"pith:6IWOAK6N","schema_version":"1.0","canonical_sha256":"f22ce02bcd06019978d05884e2ad67a7e4cd90e3d4b12b733c40456a1c71e1fa","source":{"kind":"arxiv","id":"2504.18749","version":1},"attestation_state":"computed","paper":{"title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Arun Ramamurthy, Georgios Paschos, Jian Shen, Kyle Brubaker, Kyle E. C. Booth, Martin J. A. Schuetz, Philipp Loick","submitted_at":"2025-04-26T00:10:15Z","abstract_excerpt":"We consider the logistics network of an e-commerce retailer, specifically the so-called \"middle mile\" network, that routes inventory from supply warehouses to distribution stations to be ingested into the terminal (\"last mile\") delivery network. The speed of packages through this middle mile network is a key determinant for the ultimate delivery speed to the end user. An important target for a retailer is to maximize the fraction of user orders that can be serviced within one day, i.e., next-day delivery. As such, we formulate the maximization of expected next-day delivery coverage within the "},"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":"2504.18749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-04-26T00:10:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ebfdfc14b09efd147909f245cb08ad08eccd4d035a225db761371ded67f1487c","abstract_canon_sha256":"4e2026bd0282367babe8e53e84a9ff8a2521e1523733c4e223cfb1e9395e06fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:54:20.820548Z","signature_b64":"3sSQiOf20scNK6bR5HVF02k1os0jVz8Y4hoR2DsZHGlB9Ci86hys55DM05SZSUDv+8VvxDP5FXdzh7EHZsOaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22ce02bcd06019978d05884e2ad67a7e4cd90e3d4b12b733c40456a1c71e1fa","last_reissued_at":"2026-07-05T10:54:20.820065Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:54:20.820065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Arun Ramamurthy, Georgios Paschos, Jian Shen, Kyle Brubaker, Kyle E. C. Booth, Martin J. A. Schuetz, Philipp Loick","submitted_at":"2025-04-26T00:10:15Z","abstract_excerpt":"We consider the logistics network of an e-commerce retailer, specifically the so-called \"middle mile\" network, that routes inventory from supply warehouses to distribution stations to be ingested into the terminal (\"last mile\") delivery network. The speed of packages through this middle mile network is a key determinant for the ultimate delivery speed to the end user. An important target for a retailer is to maximize the fraction of user orders that can be serviced within one day, i.e., next-day delivery. As such, we formulate the maximization of expected next-day delivery coverage within the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.18749","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/2504.18749/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":"2504.18749","created_at":"2026-07-05T10:54:20.820118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.18749v1","created_at":"2026-07-05T10:54:20.820118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.18749","created_at":"2026-07-05T10:54:20.820118+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IWOAK6NAYAZ","created_at":"2026-07-05T10:54:20.820118+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IWOAK6NAYAZS6GQ","created_at":"2026-07-05T10:54:20.820118+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IWOAK6N","created_at":"2026-07-05T10:54:20.820118+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/6IWOAK6NAYAZS6GQLCCOFLLHU7","json":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7.json","graph_json":"https://pith.science/api/pith-number/6IWOAK6NAYAZS6GQLCCOFLLHU7/graph.json","events_json":"https://pith.science/api/pith-number/6IWOAK6NAYAZS6GQLCCOFLLHU7/events.json","paper":"https://pith.science/paper/6IWOAK6N"},"agent_actions":{"view_html":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7","download_json":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7.json","view_paper":"https://pith.science/paper/6IWOAK6N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.18749&json=true","fetch_graph":"https://pith.science/api/pith-number/6IWOAK6NAYAZS6GQLCCOFLLHU7/graph.json","fetch_events":"https://pith.science/api/pith-number/6IWOAK6NAYAZS6GQLCCOFLLHU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7/action/storage_attestation","attest_author":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7/action/author_attestation","sign_citation":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7/action/citation_signature","submit_replication":"https://pith.science/pith/6IWOAK6NAYAZS6GQLCCOFLLHU7/action/replication_record"}},"created_at":"2026-07-05T10:54:20.820118+00:00","updated_at":"2026-07-05T10:54:20.820118+00:00"}