{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:F22FHLQR3YUNDZ7AJNAVZOMALV","short_pith_number":"pith:F22FHLQR","canonical_record":{"source":{"id":"1711.03591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T20:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"38da016d76ffaaedab1c24f2234da345c97e4628b016db8ff227acc35dd0af43","abstract_canon_sha256":"f7c11042dc5f32675cd23d981a2a481a90364cc14ef0063d421d45ce08b8671b"},"schema_version":"1.0"},"canonical_sha256":"2eb453ae11de28d1e7e04b415cb9805d47292efa06e19af7a3b4f6d72f76c1d3","source":{"kind":"arxiv","id":"1711.03591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03591","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03591v1","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03591","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"F22FHLQR3YUN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"F22FHLQR3YUNDZ7A","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"F22FHLQR","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:F22FHLQR3YUNDZ7AJNAVZOMALV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T20:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"38da016d76ffaaedab1c24f2234da345c97e4628b016db8ff227acc35dd0af43","abstract_canon_sha256":"f7c11042dc5f32675cd23d981a2a481a90364cc14ef0063d421d45ce08b8671b"},"schema_version":"1.0"},"canonical_sha256":"2eb453ae11de28d1e7e04b415cb9805d47292efa06e19af7a3b4f6d72f76c1d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:00.277846Z","signature_b64":"b4ArB9wUfFeZx/jh2my05sO1rYgx8sPxUI1Nw0EFVc2ErG3o21fkzPrKaF4kSZGayAc1VgAo1uw0ADGe+bmHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eb453ae11de28d1e7e04b415cb9805d47292efa06e19af7a3b4f6d72f76c1d3","last_reissued_at":"2026-05-18T00:11:00.276842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:00.276842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03591","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-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnGHxMidmYpa+HdaWmHEk/pVUAjWxObFZVOhLuXMgBdvNC54Qp1euUq26D32wO3v5n0Wvy0lKOvp+91tXIgKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:17.213309Z"},"content_sha256":"4e66573697415001ed746c77bb869a9dff3978d3ff23024e02b179b37b767f31","schema_version":"1.0","event_id":"sha256:4e66573697415001ed746c77bb869a9dff3978d3ff23024e02b179b37b767f31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:F22FHLQR3YUNDZ7AJNAVZOMALV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient-UCBV: An Almost Optimal Algorithm using Variance Estimates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Balaraman Ravindran, K. P. Naveen, Nandan Sudarsanam, Subhojyoti Mukherjee","submitted_at":"2017-11-09T20:36:21Z","abstract_excerpt":"We propose a novel variant of the UCB algorithm (referred to as Efficient-UCB-Variance (EUCBV)) for minimizing cumulative regret in the stochastic multi-armed bandit (MAB) setting. EUCBV incorporates the arm elimination strategy proposed in UCB-Improved \\citep{auer2010ucb}, while taking into account the variance estimates to compute the arms' confidence bounds, similar to UCBV \\citep{audibert2009exploration}. Through a theoretical analysis we establish that EUCBV incurs a \\emph{gap-dependent} regret bound of {\\scriptsize $O\\left( \\dfrac{K\\sigma^2_{\\max} \\log (T\\Delta^2 /K)}{\\Delta}\\right)$} af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03591","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-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcrOcOwYhVvT4Y9HgNmCcF1v7k/sUruxxvvG8XXrbHw+k0vZd1WdjFX1KreZKZF6Fci5HT8CFvQibCW7RDmkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:58:17.213698Z"},"content_sha256":"d5df1bdb9d4b78e6102675febfa73395743148ae19b5fb7df4e919e349f281f6","schema_version":"1.0","event_id":"sha256:d5df1bdb9d4b78e6102675febfa73395743148ae19b5fb7df4e919e349f281f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/bundle.json","state_url":"https://pith.science/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/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-03T09:58:17Z","links":{"resolver":"https://pith.science/pith/F22FHLQR3YUNDZ7AJNAVZOMALV","bundle":"https://pith.science/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/bundle.json","state":"https://pith.science/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F22FHLQR3YUNDZ7AJNAVZOMALV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:F22FHLQR3YUNDZ7AJNAVZOMALV","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":"f7c11042dc5f32675cd23d981a2a481a90364cc14ef0063d421d45ce08b8671b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T20:36:21Z","title_canon_sha256":"38da016d76ffaaedab1c24f2234da345c97e4628b016db8ff227acc35dd0af43"},"schema_version":"1.0","source":{"id":"1711.03591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03591","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03591v1","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03591","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"F22FHLQR3YUN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"F22FHLQR3YUNDZ7A","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"F22FHLQR","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:d5df1bdb9d4b78e6102675febfa73395743148ae19b5fb7df4e919e349f281f6","target":"graph","created_at":"2026-05-18T00:11:00Z","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 propose a novel variant of the UCB algorithm (referred to as Efficient-UCB-Variance (EUCBV)) for minimizing cumulative regret in the stochastic multi-armed bandit (MAB) setting. EUCBV incorporates the arm elimination strategy proposed in UCB-Improved \\citep{auer2010ucb}, while taking into account the variance estimates to compute the arms' confidence bounds, similar to UCBV \\citep{audibert2009exploration}. Through a theoretical analysis we establish that EUCBV incurs a \\emph{gap-dependent} regret bound of {\\scriptsize $O\\left( \\dfrac{K\\sigma^2_{\\max} \\log (T\\Delta^2 /K)}{\\Delta}\\right)$} af","authors_text":"Balaraman Ravindran, K. P. Naveen, Nandan Sudarsanam, Subhojyoti Mukherjee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T20:36:21Z","title":"Efficient-UCBV: An Almost Optimal Algorithm using Variance Estimates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03591","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:4e66573697415001ed746c77bb869a9dff3978d3ff23024e02b179b37b767f31","target":"record","created_at":"2026-05-18T00:11:00Z","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":"f7c11042dc5f32675cd23d981a2a481a90364cc14ef0063d421d45ce08b8671b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-09T20:36:21Z","title_canon_sha256":"38da016d76ffaaedab1c24f2234da345c97e4628b016db8ff227acc35dd0af43"},"schema_version":"1.0","source":{"id":"1711.03591","kind":"arxiv","version":1}},"canonical_sha256":"2eb453ae11de28d1e7e04b415cb9805d47292efa06e19af7a3b4f6d72f76c1d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eb453ae11de28d1e7e04b415cb9805d47292efa06e19af7a3b4f6d72f76c1d3","first_computed_at":"2026-05-18T00:11:00.276842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:00.276842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b4ArB9wUfFeZx/jh2my05sO1rYgx8sPxUI1Nw0EFVc2ErG3o21fkzPrKaF4kSZGayAc1VgAo1uw0ADGe+bmHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:00.277846Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e66573697415001ed746c77bb869a9dff3978d3ff23024e02b179b37b767f31","sha256:d5df1bdb9d4b78e6102675febfa73395743148ae19b5fb7df4e919e349f281f6"],"state_sha256":"f5f290f57e2436a0828088d4788eef3fa2ece62d3122a1fed0566e1ffd3bf8b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3jEsyObovTLiN6c1vwqSDhLbdHgm7dFVo6MTUdojRCTsNAX2W92azTtLTnLUCPyiuVPAl7OPvWnYY/fCjfbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:58:17.215723Z","bundle_sha256":"2e1237915b94e26e46b2f07968860fc9009a7db2abda5341ad01ed932fc52e7a"}}