{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2TY3AVQWZZSLSTYQMCW3WFQRCT","short_pith_number":"pith:2TY3AVQW","schema_version":"1.0","canonical_sha256":"d4f1b05616ce64b94f1060adbb161114db8dc79e18e03b83d38091de673182d8","source":{"kind":"arxiv","id":"2106.01135","version":5},"attestation_state":"computed","paper":{"title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Abdellah Aznag, Noemie Perivier, Vineet Goyal","submitted_at":"2021-06-02T13:05:34Z","abstract_excerpt":"We consider a dynamic assortment selection problem where a seller has a fixed inventory of $N$ substitutable products and faces an unknown demand that arrives sequentially over $T$ periods. In each period, the seller needs to decide on the assortment of products (satisfying certain constraints) to offer to the customers. The customer's response follows an unknown multinomial logit model (MNL) with parameter $\\boldsymbol{v}$. If customer selects product $i \\in [N]$, the seller receives revenue $r_i$. The goal of the seller is to maximize the total expected revenue from the $T$ customers given t"},"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":"2106.01135","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-06-02T13:05:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c9766b418830221a7521c8abcefa0cac0a6f41d266f837ad886f0aea4319964","abstract_canon_sha256":"576963f8b7a86bffb225eabad42feab75c975a56e77a8da68886c5152c467b4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:36:48.278487Z","signature_b64":"i57MtlGrQe4MLByQ8Y3TyDCDA+ftFHua5IISIlDA5X8cWxIFcGdElxyxAhRVJyEe0eD890OK2GVXOUyqhWQ/Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f1b05616ce64b94f1060adbb161114db8dc79e18e03b83d38091de673182d8","last_reissued_at":"2026-07-05T07:36:48.277854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:36:48.277854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MNL-Bandit with Knapsacks: a near-optimal algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Abdellah Aznag, Noemie Perivier, Vineet Goyal","submitted_at":"2021-06-02T13:05:34Z","abstract_excerpt":"We consider a dynamic assortment selection problem where a seller has a fixed inventory of $N$ substitutable products and faces an unknown demand that arrives sequentially over $T$ periods. In each period, the seller needs to decide on the assortment of products (satisfying certain constraints) to offer to the customers. The customer's response follows an unknown multinomial logit model (MNL) with parameter $\\boldsymbol{v}$. If customer selects product $i \\in [N]$, the seller receives revenue $r_i$. The goal of the seller is to maximize the total expected revenue from the $T$ customers given t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01135","kind":"arxiv","version":5},"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/2106.01135/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":"2106.01135","created_at":"2026-07-05T07:36:48.277926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01135v5","created_at":"2026-07-05T07:36:48.277926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01135","created_at":"2026-07-05T07:36:48.277926+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TY3AVQWZZSL","created_at":"2026-07-05T07:36:48.277926+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TY3AVQWZZSLSTYQ","created_at":"2026-07-05T07:36:48.277926+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TY3AVQW","created_at":"2026-07-05T07:36:48.277926+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19008","citing_title":"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT","json":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT.json","graph_json":"https://pith.science/api/pith-number/2TY3AVQWZZSLSTYQMCW3WFQRCT/graph.json","events_json":"https://pith.science/api/pith-number/2TY3AVQWZZSLSTYQMCW3WFQRCT/events.json","paper":"https://pith.science/paper/2TY3AVQW"},"agent_actions":{"view_html":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT","download_json":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT.json","view_paper":"https://pith.science/paper/2TY3AVQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01135&json=true","fetch_graph":"https://pith.science/api/pith-number/2TY3AVQWZZSLSTYQMCW3WFQRCT/graph.json","fetch_events":"https://pith.science/api/pith-number/2TY3AVQWZZSLSTYQMCW3WFQRCT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT/action/storage_attestation","attest_author":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT/action/author_attestation","sign_citation":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT/action/citation_signature","submit_replication":"https://pith.science/pith/2TY3AVQWZZSLSTYQMCW3WFQRCT/action/replication_record"}},"created_at":"2026-07-05T07:36:48.277926+00:00","updated_at":"2026-07-05T07:36:48.277926+00:00"}