{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5CUJG4A5KJJLZTBBO3UEFFM64C","short_pith_number":"pith:5CUJG4A5","schema_version":"1.0","canonical_sha256":"e8a893701d5252bccc2176e842959ee08a8db06dd79f3ac09fd222937718bcb6","source":{"kind":"arxiv","id":"2502.06777","version":4},"attestation_state":"computed","paper":{"title":"Learning an Optimal Assortment Policy under Observational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Han Zhong, Jose Blanchet, Miao Lu, Yuxuan Han, Zhengyuan Zhou","submitted_at":"2025-02-10T18:54:41Z","abstract_excerpt":"We study the fundamental problem of offline assortment optimization under the Multinomial Logit (MNL) model, where sellers must determine the optimal subset of the products to offer based solely on historical customer choice data. While most existing approaches to learning-based assortment optimization focus on the online learning of the optimal assortment through repeated interactions with customers, such exploration can be costly or even impractical in many real-world settings. In this paper, we consider the offline learning paradigm and investigate the minimal data requirements for efficien"},"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":"2502.06777","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-02-10T18:54:41Z","cross_cats_sorted":["cs.LG","math.OC","math.ST","stat.TH"],"title_canon_sha256":"11ab982032a8649f268db59c89f32aa2c80365d349ffc6bcb03d93268134fc5f","abstract_canon_sha256":"47891252605d8ef821194974932bbaa7bac3cb97b78fa7ae25838292b789e297"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:24.769613Z","signature_b64":"UUzjLezXtXI5TSpA3xkdSR/zVcfY5clKPhZgBkLRXYBDUD97/nueb3h+WvhrftF8xUaOtgDI/IfFdNMbls9FDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8a893701d5252bccc2176e842959ee08a8db06dd79f3ac09fd222937718bcb6","last_reissued_at":"2026-07-05T11:58:24.769131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:24.769131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning an Optimal Assortment Policy under Observational Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Han Zhong, Jose Blanchet, Miao Lu, Yuxuan Han, Zhengyuan Zhou","submitted_at":"2025-02-10T18:54:41Z","abstract_excerpt":"We study the fundamental problem of offline assortment optimization under the Multinomial Logit (MNL) model, where sellers must determine the optimal subset of the products to offer based solely on historical customer choice data. While most existing approaches to learning-based assortment optimization focus on the online learning of the optimal assortment through repeated interactions with customers, such exploration can be costly or even impractical in many real-world settings. In this paper, we consider the offline learning paradigm and investigate the minimal data requirements for efficien"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06777","kind":"arxiv","version":4},"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/2502.06777/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":"2502.06777","created_at":"2026-07-05T11:58:24.769189+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06777v4","created_at":"2026-07-05T11:58:24.769189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06777","created_at":"2026-07-05T11:58:24.769189+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CUJG4A5KJJL","created_at":"2026-07-05T11:58:24.769189+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CUJG4A5KJJLZTBB","created_at":"2026-07-05T11:58:24.769189+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CUJG4A5","created_at":"2026-07-05T11:58:24.769189+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18800","citing_title":"Optimal Exploration of New Products under Assortment Decisions","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17238","citing_title":"Learning in Position-Aware Multinomial Logit Bandits: From Multiplicative to General Position Effects","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19008","citing_title":"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18800","citing_title":"Optimal Exploration of New Products under Assortment Decisions","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C","json":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C.json","graph_json":"https://pith.science/api/pith-number/5CUJG4A5KJJLZTBBO3UEFFM64C/graph.json","events_json":"https://pith.science/api/pith-number/5CUJG4A5KJJLZTBBO3UEFFM64C/events.json","paper":"https://pith.science/paper/5CUJG4A5"},"agent_actions":{"view_html":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C","download_json":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C.json","view_paper":"https://pith.science/paper/5CUJG4A5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06777&json=true","fetch_graph":"https://pith.science/api/pith-number/5CUJG4A5KJJLZTBBO3UEFFM64C/graph.json","fetch_events":"https://pith.science/api/pith-number/5CUJG4A5KJJLZTBBO3UEFFM64C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C/action/storage_attestation","attest_author":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C/action/author_attestation","sign_citation":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C/action/citation_signature","submit_replication":"https://pith.science/pith/5CUJG4A5KJJLZTBBO3UEFFM64C/action/replication_record"}},"created_at":"2026-07-05T11:58:24.769189+00:00","updated_at":"2026-07-05T11:58:24.769189+00:00"}