{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:75JAFX5WRFWZ4SERLSYZOOXVAV","short_pith_number":"pith:75JAFX5W","schema_version":"1.0","canonical_sha256":"ff5202dfb6896d9e48915cb1973af5055180bf7921a92b42f3897e423d118bad","source":{"kind":"arxiv","id":"1903.07844","version":2},"attestation_state":"computed","paper":{"title":"Shrinking the Upper Confidence Bound: A Dynamic Product Selection Problem for Urban Warehouses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"David Simchi-Levi, Li Wang, Rong Jin, Sen Yang, Xinshang Wang","submitted_at":"2019-03-19T05:34:00Z","abstract_excerpt":"The recent rising popularity of ultra-fast delivery services on retail platforms fuels the increasing use of urban warehouses, whose proximity to customers makes fast deliveries viable. The space limit in urban warehouses poses a problem for the online retailers: the number of products (SKUs) they carry is no longer \"the more, the better\", yet it can still be significantly large, reaching hundreds or thousands in a product category. In this paper, we study algorithms for dynamically identifying a large number of products (i.e., SKUs) with top customer purchase probabilities on the fly, from an"},"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":"1903.07844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T05:34:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a17eb8f8d347fcb802b937ccbd536847e36defd39edf65e41c21475bc8d6cf0","abstract_canon_sha256":"22e3cf44274c0448edaa79bbc1b994067e7375cadd10c734569ed32fa79eb617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:08.415019Z","signature_b64":"xhhnBa7AbMW9Kvn8rgzW9sgnupyLKUUmmLCeFrdCx/XVYtkJxiRM1E1GXr3At2cHtUMUxpobl3w4gpqGRjHjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff5202dfb6896d9e48915cb1973af5055180bf7921a92b42f3897e423d118bad","last_reissued_at":"2026-05-17T23:47:08.414363Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:08.414363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shrinking the Upper Confidence Bound: A Dynamic Product Selection Problem for Urban Warehouses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"David Simchi-Levi, Li Wang, Rong Jin, Sen Yang, Xinshang Wang","submitted_at":"2019-03-19T05:34:00Z","abstract_excerpt":"The recent rising popularity of ultra-fast delivery services on retail platforms fuels the increasing use of urban warehouses, whose proximity to customers makes fast deliveries viable. The space limit in urban warehouses poses a problem for the online retailers: the number of products (SKUs) they carry is no longer \"the more, the better\", yet it can still be significantly large, reaching hundreds or thousands in a product category. In this paper, we study algorithms for dynamically identifying a large number of products (i.e., SKUs) with top customer purchase probabilities on the fly, from an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07844","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":""},"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":"1903.07844","created_at":"2026-05-17T23:47:08.414475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07844v2","created_at":"2026-05-17T23:47:08.414475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07844","created_at":"2026-05-17T23:47:08.414475+00:00"},{"alias_kind":"pith_short_12","alias_value":"75JAFX5WRFWZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"75JAFX5WRFWZ4SER","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"75JAFX5W","created_at":"2026-05-18T12:33:12.712433+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/75JAFX5WRFWZ4SERLSYZOOXVAV","json":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV.json","graph_json":"https://pith.science/api/pith-number/75JAFX5WRFWZ4SERLSYZOOXVAV/graph.json","events_json":"https://pith.science/api/pith-number/75JAFX5WRFWZ4SERLSYZOOXVAV/events.json","paper":"https://pith.science/paper/75JAFX5W"},"agent_actions":{"view_html":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV","download_json":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV.json","view_paper":"https://pith.science/paper/75JAFX5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07844&json=true","fetch_graph":"https://pith.science/api/pith-number/75JAFX5WRFWZ4SERLSYZOOXVAV/graph.json","fetch_events":"https://pith.science/api/pith-number/75JAFX5WRFWZ4SERLSYZOOXVAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV/action/storage_attestation","attest_author":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV/action/author_attestation","sign_citation":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV/action/citation_signature","submit_replication":"https://pith.science/pith/75JAFX5WRFWZ4SERLSYZOOXVAV/action/replication_record"}},"created_at":"2026-05-17T23:47:08.414475+00:00","updated_at":"2026-05-17T23:47:08.414475+00:00"}