{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:LCCPKQD4CJO67J3NS33G46VBLD","short_pith_number":"pith:LCCPKQD4","canonical_record":{"source":{"id":"1102.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-02-14T04:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"3f6212e2672855b834331f0b3ee70deb8d3424a573e928820141190503b9f86d","abstract_canon_sha256":"c442a10511709aa063e409100749485161f950832ac659ad1fab7d47b8f7c066"},"schema_version":"1.0"},"canonical_sha256":"5884f5407c125defa76d96f66e7aa158cf692cb189047117aac34d3a7416aed8","source":{"kind":"arxiv","id":"1102.2670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2670","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2670v1","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2670","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"LCCPKQD4CJO6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LCCPKQD4CJO67J3N","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LCCPKQD4","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:LCCPKQD4CJO67J3NS33G46VBLD","target":"record","payload":{"canonical_record":{"source":{"id":"1102.2670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-02-14T04:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"3f6212e2672855b834331f0b3ee70deb8d3424a573e928820141190503b9f86d","abstract_canon_sha256":"c442a10511709aa063e409100749485161f950832ac659ad1fab7d47b8f7c066"},"schema_version":"1.0"},"canonical_sha256":"5884f5407c125defa76d96f66e7aa158cf692cb189047117aac34d3a7416aed8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:46.752508Z","signature_b64":"Bsztlx8ch6SHnz/KPXb+Lrkv35UqWHqwXja81S1BcR6e5Pv58L8WsGMEgHA5g5XdpeBjL7ad6GZaUNB/wIQ8Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5884f5407c125defa76d96f66e7aa158cf692cb189047117aac34d3a7416aed8","last_reissued_at":"2026-05-18T04:28:46.752045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:46.752045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.2670","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-18T04:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9SfwbD6vfZdDt5HLLQl7QKx/18LtuZDOiDVGpEHOaC1DxxJfRI+yMnQl7SV6qUmbzsOYsyt7zntEBUVO5pWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:56:47.031220Z"},"content_sha256":"4205b9515de82e7a56716dae6b5e1eb122578757c22140ad380e8f05d7eb6aa7","schema_version":"1.0","event_id":"sha256:4205b9515de82e7a56716dae6b5e1eb122578757c22140ad380e8f05d7eb6aa7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:LCCPKQD4CJO67J3NS33G46VBLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Csaba Szepesvari, David Pal, Yasin Abbasi-Yadkori","submitted_at":"2011-02-14T04:06:31Z","abstract_excerpt":"The analysis of online least squares estimation is at the heart of many stochastic sequential decision making problems. We employ tools from the self-normalized processes to provide a simple and self-contained proof of a tail bound of a vector-valued martingale. We use the bound to construct a new tighter confidence sets for the least squares estimate.\n  We apply the confidence sets to several online decision problems, such as the multi-armed and the linearly parametrized bandit problems. The confidence sets are potentially applicable to other problems such as sleeping bandits, generalized lin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2670","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-18T04:28:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9/Bhp8/WvbRP3d3IgT8Hfm6ychzvXB5XVxzMXiETCUEA+AnQEkce0PTUpi6SKyE0XGZ/kqV1cgAiejSgU8+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:56:47.031967Z"},"content_sha256":"98c0f6ba38a9d4525b81752be5ea5af9b409f2bcba94ad83ed09cfe198170cb6","schema_version":"1.0","event_id":"sha256:98c0f6ba38a9d4525b81752be5ea5af9b409f2bcba94ad83ed09cfe198170cb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LCCPKQD4CJO67J3NS33G46VBLD/bundle.json","state_url":"https://pith.science/pith/LCCPKQD4CJO67J3NS33G46VBLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LCCPKQD4CJO67J3NS33G46VBLD/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-26T06:56:47Z","links":{"resolver":"https://pith.science/pith/LCCPKQD4CJO67J3NS33G46VBLD","bundle":"https://pith.science/pith/LCCPKQD4CJO67J3NS33G46VBLD/bundle.json","state":"https://pith.science/pith/LCCPKQD4CJO67J3NS33G46VBLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LCCPKQD4CJO67J3NS33G46VBLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:LCCPKQD4CJO67J3NS33G46VBLD","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":"c442a10511709aa063e409100749485161f950832ac659ad1fab7d47b8f7c066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-02-14T04:06:31Z","title_canon_sha256":"3f6212e2672855b834331f0b3ee70deb8d3424a573e928820141190503b9f86d"},"schema_version":"1.0","source":{"id":"1102.2670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.2670","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.2670v1","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2670","created_at":"2026-05-18T04:28:46Z"},{"alias_kind":"pith_short_12","alias_value":"LCCPKQD4CJO6","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"LCCPKQD4CJO67J3N","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"LCCPKQD4","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:98c0f6ba38a9d4525b81752be5ea5af9b409f2bcba94ad83ed09cfe198170cb6","target":"graph","created_at":"2026-05-18T04:28:46Z","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":"The analysis of online least squares estimation is at the heart of many stochastic sequential decision making problems. We employ tools from the self-normalized processes to provide a simple and self-contained proof of a tail bound of a vector-valued martingale. We use the bound to construct a new tighter confidence sets for the least squares estimate.\n  We apply the confidence sets to several online decision problems, such as the multi-armed and the linearly parametrized bandit problems. The confidence sets are potentially applicable to other problems such as sleeping bandits, generalized lin","authors_text":"Csaba Szepesvari, David Pal, Yasin Abbasi-Yadkori","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-02-14T04:06:31Z","title":"Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2670","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:4205b9515de82e7a56716dae6b5e1eb122578757c22140ad380e8f05d7eb6aa7","target":"record","created_at":"2026-05-18T04:28:46Z","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":"c442a10511709aa063e409100749485161f950832ac659ad1fab7d47b8f7c066","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-02-14T04:06:31Z","title_canon_sha256":"3f6212e2672855b834331f0b3ee70deb8d3424a573e928820141190503b9f86d"},"schema_version":"1.0","source":{"id":"1102.2670","kind":"arxiv","version":1}},"canonical_sha256":"5884f5407c125defa76d96f66e7aa158cf692cb189047117aac34d3a7416aed8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5884f5407c125defa76d96f66e7aa158cf692cb189047117aac34d3a7416aed8","first_computed_at":"2026-05-18T04:28:46.752045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:46.752045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bsztlx8ch6SHnz/KPXb+Lrkv35UqWHqwXja81S1BcR6e5Pv58L8WsGMEgHA5g5XdpeBjL7ad6GZaUNB/wIQ8Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:46.752508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.2670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4205b9515de82e7a56716dae6b5e1eb122578757c22140ad380e8f05d7eb6aa7","sha256:98c0f6ba38a9d4525b81752be5ea5af9b409f2bcba94ad83ed09cfe198170cb6"],"state_sha256":"7d80ad881dc7717257de7e9b922ba1dcb93fc31b022add464d7f0776357b2a73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Usq0CE8hFPpIEPVEPEOopuwnhxNn9nAOYIUGsA7Iv1Y28wSl2So8x4Y0II8e7LKErOGezTBf4jJuV0R4t7d3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:56:47.035790Z","bundle_sha256":"d2f4cd276e78f51155fcc8881857b03712e16747abe0fab675341a8a252524d4"}}