{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SKUPWPQ5NKVUTTWP3B7RH7V32D","short_pith_number":"pith:SKUPWPQ5","schema_version":"1.0","canonical_sha256":"92a8fb3e1d6aab49cecfd87f13febbd0c188622eb4585593d542c7609d2b648f","source":{"kind":"arxiv","id":"2505.17340","version":2},"attestation_state":"computed","paper":{"title":"Conformal Predictive Distributions for Order Fulfillment Time Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amira Hijazi, Pascal Van Hentenryck, Tinghan Ye","submitted_at":"2025-05-22T23:23:52Z","abstract_excerpt":"Accurate estimation of order fulfillment time is critical for e-commerce logistics, yet traditional rule-based approaches often fail to capture the inherent uncertainties in delivery operations. This paper introduces a novel framework for distributional forecasting of order fulfillment time, leveraging Conformal Predictive Systems and Cross Venn-Abers Predictors -- model-agnostic techniques that provide rigorous coverage or validity guarantees. The proposed machine learning methods integrate granular spatiotemporal features, capturing fulfillment location and carrier performance dynamics to en"},"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":"2505.17340","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-22T23:23:52Z","cross_cats_sorted":[],"title_canon_sha256":"18add11bc2eec9092448951c325a5789efd52b3491cde0f51dd387c3339c3bab","abstract_canon_sha256":"acb098cb2341893bf6c19440fe2eb7fe5fc677dd40ef0acbe464ab0835187dd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:46:43.486936Z","signature_b64":"t/leepgiZfF7ow48RTV0C77Ob/rqF7QrDgumXignX+jgeOZyGKxoHB4VBigb5VIHTetfguzQM7ImTY2qNa1CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a8fb3e1d6aab49cecfd87f13febbd0c188622eb4585593d542c7609d2b648f","last_reissued_at":"2026-07-05T11:46:43.486468Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:46:43.486468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conformal Predictive Distributions for Order Fulfillment Time Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Amira Hijazi, Pascal Van Hentenryck, Tinghan Ye","submitted_at":"2025-05-22T23:23:52Z","abstract_excerpt":"Accurate estimation of order fulfillment time is critical for e-commerce logistics, yet traditional rule-based approaches often fail to capture the inherent uncertainties in delivery operations. This paper introduces a novel framework for distributional forecasting of order fulfillment time, leveraging Conformal Predictive Systems and Cross Venn-Abers Predictors -- model-agnostic techniques that provide rigorous coverage or validity guarantees. The proposed machine learning methods integrate granular spatiotemporal features, capturing fulfillment location and carrier performance dynamics to en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17340","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/2505.17340/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":"2505.17340","created_at":"2026-07-05T11:46:43.486528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.17340v2","created_at":"2026-07-05T11:46:43.486528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17340","created_at":"2026-07-05T11:46:43.486528+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKUPWPQ5NKVU","created_at":"2026-07-05T11:46:43.486528+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKUPWPQ5NKVUTTWP","created_at":"2026-07-05T11:46:43.486528+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKUPWPQ5","created_at":"2026-07-05T11:46:43.486528+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25362","citing_title":"Learning Optimization Proxies for Sequential Contextual Stochastic Programs: An Order Fulfillment Application","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D","json":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D.json","graph_json":"https://pith.science/api/pith-number/SKUPWPQ5NKVUTTWP3B7RH7V32D/graph.json","events_json":"https://pith.science/api/pith-number/SKUPWPQ5NKVUTTWP3B7RH7V32D/events.json","paper":"https://pith.science/paper/SKUPWPQ5"},"agent_actions":{"view_html":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D","download_json":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D.json","view_paper":"https://pith.science/paper/SKUPWPQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.17340&json=true","fetch_graph":"https://pith.science/api/pith-number/SKUPWPQ5NKVUTTWP3B7RH7V32D/graph.json","fetch_events":"https://pith.science/api/pith-number/SKUPWPQ5NKVUTTWP3B7RH7V32D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D/action/storage_attestation","attest_author":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D/action/author_attestation","sign_citation":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D/action/citation_signature","submit_replication":"https://pith.science/pith/SKUPWPQ5NKVUTTWP3B7RH7V32D/action/replication_record"}},"created_at":"2026-07-05T11:46:43.486528+00:00","updated_at":"2026-07-05T11:46:43.486528+00:00"}