{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:S5R45UAE6PMFGKTTV2OCJZ42OU","short_pith_number":"pith:S5R45UAE","canonical_record":{"source":{"id":"1209.3353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-15T03:41:18Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"f94e11a827658120e69754ead996762edb26a1e4afd1bd8e8a251e6d70c2c262","abstract_canon_sha256":"c9b9ff76b733a35b2ae3c1a25808e05313b6232ea5b38d8c84000a861f6bf4da"},"schema_version":"1.0"},"canonical_sha256":"9763ced004f3d8532a73ae9c24e79a7522e1332b477007fd51d1c6263756f80b","source":{"kind":"arxiv","id":"1209.3353","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3353","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3353v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3353","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"S5R45UAE6PMF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5R45UAE6PMFGKTT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5R45UAE","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:S5R45UAE6PMFGKTTV2OCJZ42OU","target":"record","payload":{"canonical_record":{"source":{"id":"1209.3353","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-15T03:41:18Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"f94e11a827658120e69754ead996762edb26a1e4afd1bd8e8a251e6d70c2c262","abstract_canon_sha256":"c9b9ff76b733a35b2ae3c1a25808e05313b6232ea5b38d8c84000a861f6bf4da"},"schema_version":"1.0"},"canonical_sha256":"9763ced004f3d8532a73ae9c24e79a7522e1332b477007fd51d1c6263756f80b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:31.133180Z","signature_b64":"gloHQimyf9gmBlsOQat7yDaqZ2Tg+XSfprlLUqRFXlshQ8SfKWyYewKgR0ZtadTnzIUPRiGAcViYmlN6L9qeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9763ced004f3d8532a73ae9c24e79a7522e1332b477007fd51d1c6263756f80b","last_reissued_at":"2026-05-18T03:45:31.132599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:31.132599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.3353","source_version":1,"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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mZi1vEkQ498SoHQqZu/h2osoMA7YyuuSq6AxorlcSZLWxYkW+Wbrwelb2jttJWHYXWIEYyZPxhk1Et1oFE/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:42.517763Z"},"content_sha256":"98648233ae62260aac0c783e0be93a96f34c089f9ceb31908290413c96454c4e","schema_version":"1.0","event_id":"sha256:98648233ae62260aac0c783e0be93a96f34c089f9ceb31908290413c96454c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:S5R45UAE6PMFGKTTV2OCJZ42OU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Further Optimal Regret Bounds for Thompson Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Navin Goyal, Shipra Agrawal","submitted_at":"2012-09-15T03:41:18Z","abstract_excerpt":"Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better empirical performance compared to the state of the art methods. In this paper, we provide a novel regret analysis for Thompson Sampling that simultaneously proves both the optimal problem-dependent bound of $(1+\\epsilon)\\sum_i \\frac{\\ln T}{\\Delta_i}+O(\\frac{N}{\\epsilon^2})$ and the first near-optimal problem-independent bound of $O(\\sqrt{NT\\ln T})$ on the expe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3353","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"},"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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEW/TxYlV8YYueFNiGGZV5agBoTi1cd2jzaHTzTBg+Phn1GpuwUgHbdfh2UDehRJA50JIXtzcIrf9Owx6DfECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:00:42.518460Z"},"content_sha256":"43b036d1a362f4c694ca5fa97e6555138ba96174bb95c25dccfb8a6b278657a9","schema_version":"1.0","event_id":"sha256:43b036d1a362f4c694ca5fa97e6555138ba96174bb95c25dccfb8a6b278657a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/bundle.json","state_url":"https://pith.science/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/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-06-06T19:00:42Z","links":{"resolver":"https://pith.science/pith/S5R45UAE6PMFGKTTV2OCJZ42OU","bundle":"https://pith.science/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/bundle.json","state":"https://pith.science/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5R45UAE6PMFGKTTV2OCJZ42OU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:S5R45UAE6PMFGKTTV2OCJZ42OU","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":"c9b9ff76b733a35b2ae3c1a25808e05313b6232ea5b38d8c84000a861f6bf4da","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-15T03:41:18Z","title_canon_sha256":"f94e11a827658120e69754ead996762edb26a1e4afd1bd8e8a251e6d70c2c262"},"schema_version":"1.0","source":{"id":"1209.3353","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.3353","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1209.3353v1","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.3353","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"S5R45UAE6PMF","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"S5R45UAE6PMFGKTT","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"S5R45UAE","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:43b036d1a362f4c694ca5fa97e6555138ba96174bb95c25dccfb8a6b278657a9","target":"graph","created_at":"2026-05-18T03:45:31Z","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":"Thompson Sampling is one of the oldest heuristics for multi-armed bandit problems. It is a randomized algorithm based on Bayesian ideas, and has recently generated significant interest after several studies demonstrated it to have better empirical performance compared to the state of the art methods. In this paper, we provide a novel regret analysis for Thompson Sampling that simultaneously proves both the optimal problem-dependent bound of $(1+\\epsilon)\\sum_i \\frac{\\ln T}{\\Delta_i}+O(\\frac{N}{\\epsilon^2})$ and the first near-optimal problem-independent bound of $O(\\sqrt{NT\\ln T})$ on the expe","authors_text":"Navin Goyal, Shipra Agrawal","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-15T03:41:18Z","title":"Further Optimal Regret Bounds for Thompson Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.3353","kind":"arxiv","version":1},"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:98648233ae62260aac0c783e0be93a96f34c089f9ceb31908290413c96454c4e","target":"record","created_at":"2026-05-18T03:45:31Z","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":"c9b9ff76b733a35b2ae3c1a25808e05313b6232ea5b38d8c84000a861f6bf4da","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-15T03:41:18Z","title_canon_sha256":"f94e11a827658120e69754ead996762edb26a1e4afd1bd8e8a251e6d70c2c262"},"schema_version":"1.0","source":{"id":"1209.3353","kind":"arxiv","version":1}},"canonical_sha256":"9763ced004f3d8532a73ae9c24e79a7522e1332b477007fd51d1c6263756f80b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9763ced004f3d8532a73ae9c24e79a7522e1332b477007fd51d1c6263756f80b","first_computed_at":"2026-05-18T03:45:31.132599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:31.132599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gloHQimyf9gmBlsOQat7yDaqZ2Tg+XSfprlLUqRFXlshQ8SfKWyYewKgR0ZtadTnzIUPRiGAcViYmlN6L9qeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:31.133180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.3353","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98648233ae62260aac0c783e0be93a96f34c089f9ceb31908290413c96454c4e","sha256:43b036d1a362f4c694ca5fa97e6555138ba96174bb95c25dccfb8a6b278657a9"],"state_sha256":"2391471fafeb004e6f70bc60b44594d607d0ef3fde619359a4cd20fc3275f752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObQirZvxUc5wciJ4iIoXSmk64ftHrbuUdtdBA3g5at3pQFmp21/VSZi7SFpSK7wacCcJKUgN+tUNGzJkqVzpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:00:42.521981Z","bundle_sha256":"a1b5560e31bb37495f67fbba1dbe36120a213f385c4f897cb4ccc753b1880ede"}}