{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ILZV7Z4TMKL4C3FLUDQEXAS2LI","short_pith_number":"pith:ILZV7Z4T","schema_version":"1.0","canonical_sha256":"42f35fe7936297c16caba0e04b825a5a129cb47931a02ed2fd81eae304b47b54","source":{"kind":"arxiv","id":"1704.00108","version":1},"attestation_state":"computed","paper":{"title":"Assortment Optimization under Unknown MultiNomial Logit Choice Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Wang Chi Cheung","submitted_at":"2017-04-01T02:37:53Z","abstract_excerpt":"Motivated by e-commerce, we study the online assortment optimization problem. The seller offers an assortment, i.e. a subset of products, to each arriving customer, who then purchases one or no product from her offered assortment. A customer's purchase decision is governed by the underlying MultiNomial Logit (MNL) choice model. The seller aims to maximize the total revenue in a finite sales horizon, subject to resource constraints and uncertainty in the MNL choice model. We first propose an efficient online policy which incurs a regret $\\tilde{O}(T^{2/3})$, where $T$ is the number of customers"},"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":"1704.00108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-01T02:37:53Z","cross_cats_sorted":[],"title_canon_sha256":"bd35bb06ea3e0c41e4579027d89aaaeb923a26c8a9b32a599b7084cf108b9e3a","abstract_canon_sha256":"225eced16d387023a2d54fe17a11fde8240e95076524143994e1fc409da9dc5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:25.435788Z","signature_b64":"fMOG0MxTyzD9YuRnXTVrZrQcPzUPoO2jIlCId08zuj/B7XPQuzs9i0whaTwcL17g260qQ0m/rel9hrjoakL6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f35fe7936297c16caba0e04b825a5a129cb47931a02ed2fd81eae304b47b54","last_reissued_at":"2026-05-18T00:47:25.435109Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:25.435109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assortment Optimization under Unknown MultiNomial Logit Choice Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David Simchi-Levi, Wang Chi Cheung","submitted_at":"2017-04-01T02:37:53Z","abstract_excerpt":"Motivated by e-commerce, we study the online assortment optimization problem. The seller offers an assortment, i.e. a subset of products, to each arriving customer, who then purchases one or no product from her offered assortment. A customer's purchase decision is governed by the underlying MultiNomial Logit (MNL) choice model. The seller aims to maximize the total revenue in a finite sales horizon, subject to resource constraints and uncertainty in the MNL choice model. We first propose an efficient online policy which incurs a regret $\\tilde{O}(T^{2/3})$, where $T$ is the number of customers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00108","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.00108","created_at":"2026-05-18T00:47:25.435198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00108v1","created_at":"2026-05-18T00:47:25.435198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00108","created_at":"2026-05-18T00:47:25.435198+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILZV7Z4TMKL4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILZV7Z4TMKL4C3FL","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILZV7Z4T","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.19008","citing_title":"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing","ref_index":95,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI","json":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI.json","graph_json":"https://pith.science/api/pith-number/ILZV7Z4TMKL4C3FLUDQEXAS2LI/graph.json","events_json":"https://pith.science/api/pith-number/ILZV7Z4TMKL4C3FLUDQEXAS2LI/events.json","paper":"https://pith.science/paper/ILZV7Z4T"},"agent_actions":{"view_html":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI","download_json":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI.json","view_paper":"https://pith.science/paper/ILZV7Z4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00108&json=true","fetch_graph":"https://pith.science/api/pith-number/ILZV7Z4TMKL4C3FLUDQEXAS2LI/graph.json","fetch_events":"https://pith.science/api/pith-number/ILZV7Z4TMKL4C3FLUDQEXAS2LI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI/action/storage_attestation","attest_author":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI/action/author_attestation","sign_citation":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI/action/citation_signature","submit_replication":"https://pith.science/pith/ILZV7Z4TMKL4C3FLUDQEXAS2LI/action/replication_record"}},"created_at":"2026-05-18T00:47:25.435198+00:00","updated_at":"2026-05-18T00:47:25.435198+00:00"}