{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SZYYRFEVQHGHFQWNUPIKI26RJE","short_pith_number":"pith:SZYYRFEV","canonical_record":{"source":{"id":"1805.02971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-08T12:23:54Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"fd9bff22f35ef100f75c4c3d9554a329b5e55ad6a525f1476f7a618a631896ef","abstract_canon_sha256":"c838ddf92b0f750dcb855af7b7ed3093bb6a1c359f4eb5070f0454406f7100aa"},"schema_version":"1.0"},"canonical_sha256":"967188949581cc72c2cda3d0a46bd1492695efd3cf81212eb829563829875eab","source":{"kind":"arxiv","id":"1805.02971","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02971","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02971v2","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02971","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"SZYYRFEVQHGH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZYYRFEVQHGHFQWN","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZYYRFEV","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SZYYRFEVQHGHFQWNUPIKI26RJE","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02971","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-08T12:23:54Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"fd9bff22f35ef100f75c4c3d9554a329b5e55ad6a525f1476f7a618a631896ef","abstract_canon_sha256":"c838ddf92b0f750dcb855af7b7ed3093bb6a1c359f4eb5070f0454406f7100aa"},"schema_version":"1.0"},"canonical_sha256":"967188949581cc72c2cda3d0a46bd1492695efd3cf81212eb829563829875eab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:18.381227Z","signature_b64":"h7n6/HHLX54Z3dH0Ap37542SQY3br2rSpvJ84gmROUYkkrlUpQGBIsVQIcT0TC7B4J3C2ku5tkXt1Msn/SrWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"967188949581cc72c2cda3d0a46bd1492695efd3cf81212eb829563829875eab","last_reissued_at":"2026-05-17T23:52:18.380652Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:18.380652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02971","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-17T23:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nnu+L7bwtUfkty1qPeSj0K1ksnywQHqhtgb68s9zM5yW9kpbExM4XYO1tzKzhGFIs+SbSvuw+2I0H4umNn7zAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:26:18.891257Z"},"content_sha256":"89a53619732f768d6742b590fe2b7bcad3fc3b0d95694fc4159887bf3dcd8443","schema_version":"1.0","event_id":"sha256:89a53619732f768d6742b590fe2b7bcad3fc3b0d95694fc4159887bf3dcd8443"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SZYYRFEVQHGHFQWNUPIKI26RJE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multinomial Logit Bandit with Linear Utility Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Mingdong Ou, Nan Li, Rong Jin, Shenghuo Zhu","submitted_at":"2018-05-08T12:23:54Z","abstract_excerpt":"Multinomial logit bandit is a sequential subset selection problem which arises in many applications. In each round, the player selects a $K$-cardinality subset from $N$ candidate items, and receives a reward which is governed by a {\\it multinomial logit} (MNL) choice model considering both item utility and substitution property among items. The player's objective is to dynamically learn the parameters of MNL model and maximize cumulative reward over a finite horizon $T$. This problem faces the exploration-exploitation dilemma, and the involved combinatorial nature makes it non-trivial. In rece"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02971","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-17T23:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUHJYFBbzYt2m1fe8rMbHMWgVjRQFpsbf065LaJLZh/su6mQ50MRWLE/+JihH3hZeIT7C4frPf6hOMEam00xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T09:26:18.891947Z"},"content_sha256":"a3ef626d34dea16f49f1d97364c3a77dc741a219734d9bccb601c8ed1cc10a08","schema_version":"1.0","event_id":"sha256:a3ef626d34dea16f49f1d97364c3a77dc741a219734d9bccb601c8ed1cc10a08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/bundle.json","state_url":"https://pith.science/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/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-23T09:26:18Z","links":{"resolver":"https://pith.science/pith/SZYYRFEVQHGHFQWNUPIKI26RJE","bundle":"https://pith.science/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/bundle.json","state":"https://pith.science/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZYYRFEVQHGHFQWNUPIKI26RJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SZYYRFEVQHGHFQWNUPIKI26RJE","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":"c838ddf92b0f750dcb855af7b7ed3093bb6a1c359f4eb5070f0454406f7100aa","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-08T12:23:54Z","title_canon_sha256":"fd9bff22f35ef100f75c4c3d9554a329b5e55ad6a525f1476f7a618a631896ef"},"schema_version":"1.0","source":{"id":"1805.02971","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02971","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02971v2","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02971","created_at":"2026-05-17T23:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"SZYYRFEVQHGH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZYYRFEVQHGHFQWN","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZYYRFEV","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:a3ef626d34dea16f49f1d97364c3a77dc741a219734d9bccb601c8ed1cc10a08","target":"graph","created_at":"2026-05-17T23:52:18Z","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":"Multinomial logit bandit is a sequential subset selection problem which arises in many applications. In each round, the player selects a $K$-cardinality subset from $N$ candidate items, and receives a reward which is governed by a {\\it multinomial logit} (MNL) choice model considering both item utility and substitution property among items. The player's objective is to dynamically learn the parameters of MNL model and maximize cumulative reward over a finite horizon $T$. This problem faces the exploration-exploitation dilemma, and the involved combinatorial nature makes it non-trivial. In rece","authors_text":"Mingdong Ou, Nan Li, Rong Jin, Shenghuo Zhu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-08T12:23:54Z","title":"Multinomial Logit Bandit with Linear Utility Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02971","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:89a53619732f768d6742b590fe2b7bcad3fc3b0d95694fc4159887bf3dcd8443","target":"record","created_at":"2026-05-17T23:52:18Z","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":"c838ddf92b0f750dcb855af7b7ed3093bb6a1c359f4eb5070f0454406f7100aa","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-08T12:23:54Z","title_canon_sha256":"fd9bff22f35ef100f75c4c3d9554a329b5e55ad6a525f1476f7a618a631896ef"},"schema_version":"1.0","source":{"id":"1805.02971","kind":"arxiv","version":2}},"canonical_sha256":"967188949581cc72c2cda3d0a46bd1492695efd3cf81212eb829563829875eab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"967188949581cc72c2cda3d0a46bd1492695efd3cf81212eb829563829875eab","first_computed_at":"2026-05-17T23:52:18.380652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:18.380652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7n6/HHLX54Z3dH0Ap37542SQY3br2rSpvJ84gmROUYkkrlUpQGBIsVQIcT0TC7B4J3C2ku5tkXt1Msn/SrWDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:18.381227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02971","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a53619732f768d6742b590fe2b7bcad3fc3b0d95694fc4159887bf3dcd8443","sha256:a3ef626d34dea16f49f1d97364c3a77dc741a219734d9bccb601c8ed1cc10a08"],"state_sha256":"47681356a6610658ef0c884e5cbada56f2aa2fe089b89c51c42b47d2e51a80bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QODLzAMcr3d2O+z+4vs5eYjAqYyq6rNOQag+pbTwREMvZq4yRduk28rvVHwQ6GavZKSgJgJljo0+uSKrR0cZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T09:26:18.895427Z","bundle_sha256":"dafdf690b0b59ad6607387d06b39f59863d573a352b34acd5f225cc91372b3e0"}}