{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WCJQWZTUAI7Z7ERKCB72FPVQAG","short_pith_number":"pith:WCJQWZTU","canonical_record":{"source":{"id":"1706.03880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T00:54:47Z","cross_cats_sorted":[],"title_canon_sha256":"56cc7be063968ef561e0aa7511b3945795dab91e8dfad141975c8d298d3ef209","abstract_canon_sha256":"90c85281b3b6b03aca3b0750f371931af47e3201cfa24275541189cef542480e"},"schema_version":"1.0"},"canonical_sha256":"b0930b6674023f9f922a107fa2beb001b8530049eb6b7a09560b9ec32c5b7288","source":{"kind":"arxiv","id":"1706.03880","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03880","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03880v2","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03880","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"WCJQWZTUAI7Z","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WCJQWZTUAI7Z7ERK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WCJQWZTU","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WCJQWZTUAI7Z7ERKCB72FPVQAG","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03880","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T00:54:47Z","cross_cats_sorted":[],"title_canon_sha256":"56cc7be063968ef561e0aa7511b3945795dab91e8dfad141975c8d298d3ef209","abstract_canon_sha256":"90c85281b3b6b03aca3b0750f371931af47e3201cfa24275541189cef542480e"},"schema_version":"1.0"},"canonical_sha256":"b0930b6674023f9f922a107fa2beb001b8530049eb6b7a09560b9ec32c5b7288","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:58.231787Z","signature_b64":"MkoLGxwrJ5InW3kEPBB67cdfMMH5FUMI5Y+2c5Pu8I+JW7WZ27RDiJW6pnHOZOcwHiOa2vW6iUtLteua+tGOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0930b6674023f9f922a107fa2beb001b8530049eb6b7a09560b9ec32c5b7288","last_reissued_at":"2026-05-18T00:11:58.231098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:58.231098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03880","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xf/FGdgUZDrkAUvYiYd9w5Su4tH3xZmhKXaJCYYtjZC3uJdoLndSzbAum0Hnf4vfPnpOAtY58K+ItBCJs4UGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:07:42.592341Z"},"content_sha256":"da9ef6da9b6bff9dc48fbe7fd79cb6976947574eda662d4407650715d13559dd","schema_version":"1.0","event_id":"sha256:da9ef6da9b6bff9dc48fbe7fd79cb6976947574eda662d4407650715d13559dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WCJQWZTUAI7Z7ERKCB72FPVQAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MNL-Bandit: A Dynamic Learning Approach to Assortment Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Assaf Zeevi, Shipra Agrawal, Vashist Avadhanula, Vineet Goyal","submitted_at":"2017-06-13T00:54:47Z","abstract_excerpt":"We consider a dynamic assortment selection problem, where in every round the retailer offers a subset (assortment) of $N$ substitutable products to a consumer, who selects one of these products according to a multinomial logit (MNL) choice model. The retailer observes this choice and the objective is to dynamically learn the model parameters, while optimizing cumulative revenues over a selling horizon of length $T$. We refer to this exploration-exploitation formulation as the MNL-Bandit problem. Existing methods for this problem follow an \"explore-then-exploit\" approach, which estimate paramet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03880","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUatSCFAMHvUlDvIXbfGt3c5CdkbPn8ylqB1066hOnXm2oT3X1UqGn4Da40oudtKo3qMM6yhUOB1IUBK/lMOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:07:42.593005Z"},"content_sha256":"50b1e557d48df1226025acb70f49e92dafd663e48c1794b88b20b800727fb68d","schema_version":"1.0","event_id":"sha256:50b1e557d48df1226025acb70f49e92dafd663e48c1794b88b20b800727fb68d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/bundle.json","state_url":"https://pith.science/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T06:07:42Z","links":{"resolver":"https://pith.science/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG","bundle":"https://pith.science/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/bundle.json","state":"https://pith.science/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WCJQWZTUAI7Z7ERKCB72FPVQAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WCJQWZTUAI7Z7ERKCB72FPVQAG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"90c85281b3b6b03aca3b0750f371931af47e3201cfa24275541189cef542480e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T00:54:47Z","title_canon_sha256":"56cc7be063968ef561e0aa7511b3945795dab91e8dfad141975c8d298d3ef209"},"schema_version":"1.0","source":{"id":"1706.03880","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03880","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03880v2","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03880","created_at":"2026-05-18T00:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"WCJQWZTUAI7Z","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WCJQWZTUAI7Z7ERK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WCJQWZTU","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:50b1e557d48df1226025acb70f49e92dafd663e48c1794b88b20b800727fb68d","target":"graph","created_at":"2026-05-18T00:11:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a dynamic assortment selection problem, where in every round the retailer offers a subset (assortment) of $N$ substitutable products to a consumer, who selects one of these products according to a multinomial logit (MNL) choice model. The retailer observes this choice and the objective is to dynamically learn the model parameters, while optimizing cumulative revenues over a selling horizon of length $T$. We refer to this exploration-exploitation formulation as the MNL-Bandit problem. Existing methods for this problem follow an \"explore-then-exploit\" approach, which estimate paramet","authors_text":"Assaf Zeevi, Shipra Agrawal, Vashist Avadhanula, Vineet Goyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T00:54:47Z","title":"MNL-Bandit: A Dynamic Learning Approach to Assortment Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03880","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:da9ef6da9b6bff9dc48fbe7fd79cb6976947574eda662d4407650715d13559dd","target":"record","created_at":"2026-05-18T00:11:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"90c85281b3b6b03aca3b0750f371931af47e3201cfa24275541189cef542480e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-13T00:54:47Z","title_canon_sha256":"56cc7be063968ef561e0aa7511b3945795dab91e8dfad141975c8d298d3ef209"},"schema_version":"1.0","source":{"id":"1706.03880","kind":"arxiv","version":2}},"canonical_sha256":"b0930b6674023f9f922a107fa2beb001b8530049eb6b7a09560b9ec32c5b7288","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0930b6674023f9f922a107fa2beb001b8530049eb6b7a09560b9ec32c5b7288","first_computed_at":"2026-05-18T00:11:58.231098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:58.231098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkoLGxwrJ5InW3kEPBB67cdfMMH5FUMI5Y+2c5Pu8I+JW7WZ27RDiJW6pnHOZOcwHiOa2vW6iUtLteua+tGOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:58.231787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03880","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da9ef6da9b6bff9dc48fbe7fd79cb6976947574eda662d4407650715d13559dd","sha256:50b1e557d48df1226025acb70f49e92dafd663e48c1794b88b20b800727fb68d"],"state_sha256":"f518f9d026ae91c0cd4fbdcb4a6149d9402ac970c71b6fe1808e77ffbecb8a1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTVISq8tALocbJ5kodJR0Ty95xZ+MnOptdn6Hcn6xNzCYrwSF7imcVUyI8KW0kxzwn8AdQeqntBXJZIsHyvgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:07:42.596549Z","bundle_sha256":"f6fd317c57479e0112d1467d777aa7c6488da14a8d6cdf415c4f9f0d83d55df7"}}