{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JNV36PAC7IBKLTGSWY273Q3VMZ","short_pith_number":"pith:JNV36PAC","canonical_record":{"source":{"id":"2412.06126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-12-09T01:14:02Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"69402eb72454c45589cb08acea4459aee8900ae7db6bd9ff1852064f15cb01ee","abstract_canon_sha256":"2054bc3ddeb2e5722d70aecb89adc17e9578ad96d71b64fe9dc2f94134205193"},"schema_version":"1.0"},"canonical_sha256":"4b6bbf3c02fa02a5ccd2b635fdc375667fa281ab36edfa9e9429bdf401cc039b","source":{"kind":"arxiv","id":"2412.06126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06126","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06126v1","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06126","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"JNV36PAC7IBK","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"JNV36PAC7IBKLTGS","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"JNV36PAC","created_at":"2026-07-05T09:46:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JNV36PAC7IBKLTGSWY273Q3VMZ","target":"record","payload":{"canonical_record":{"source":{"id":"2412.06126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-12-09T01:14:02Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"69402eb72454c45589cb08acea4459aee8900ae7db6bd9ff1852064f15cb01ee","abstract_canon_sha256":"2054bc3ddeb2e5722d70aecb89adc17e9578ad96d71b64fe9dc2f94134205193"},"schema_version":"1.0"},"canonical_sha256":"4b6bbf3c02fa02a5ccd2b635fdc375667fa281ab36edfa9e9429bdf401cc039b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:15.757719Z","signature_b64":"sCtF4uEweYiruSXpgepN8m1Gv4Xjw3z1aw+GaVOGX0frlTR9VB5xATZtgAfYWZ33uRODHs+S0OS627PsMAZHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b6bbf3c02fa02a5ccd2b635fdc375667fa281ab36edfa9e9429bdf401cc039b","last_reissued_at":"2026-07-05T09:46:15.757196Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:15.757196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.06126","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-07-05T09:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dw0zMP23lZrhWSpxrpQwLk+MWAjRe0dW3VRlLWgEC0HLDay12LyUrLs8HXL4B2JHJOf9zgViZrrDSC53x/TTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:47:21.142127Z"},"content_sha256":"eb22ac703e614cdb1486e3b6eed95fab6c7b23cfdef87d13b56d24ecf6d07f3c","schema_version":"1.0","event_id":"sha256:eb22ac703e614cdb1486e3b6eed95fab6c7b23cfdef87d13b56d24ecf6d07f3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JNV36PAC7IBKLTGSWY273Q3VMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UCB algorithms for multi-armed bandits: Precise regret and adaptive inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Cun-Hui Zhang, Koulik Khamaru, Qiyang Han","submitted_at":"2024-12-09T01:14:02Z","abstract_excerpt":"Upper Confidence Bound (UCB) algorithms are a widely-used class of sequential algorithms for the $K$-armed bandit problem. Despite extensive research over the past decades aimed at understanding their asymptotic and (near) minimax optimality properties, a precise understanding of their regret behavior remains elusive. This gap has not only hindered the evaluation of their actual algorithmic efficiency, but also limited further developments in statistical inference in sequential data collection.\n  This paper bridges these two fundamental aspects--precise regret analysis and adaptive statistical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06126","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.06126/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a277l1jYg16SQm/ksMVUDOUrYOX0oGFYOylTF2vbXSjk/Bozz/wtd3tnZfb6vTLHCDvnIqq85Wh0TUXrxCzXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:47:21.142525Z"},"content_sha256":"addc475feeed15a1deff8cc7a68f54a0b7798113b32c7ff3ccf17118d6c87ba9","schema_version":"1.0","event_id":"sha256:addc475feeed15a1deff8cc7a68f54a0b7798113b32c7ff3ccf17118d6c87ba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/bundle.json","state_url":"https://pith.science/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/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-07-07T06:47:21Z","links":{"resolver":"https://pith.science/pith/JNV36PAC7IBKLTGSWY273Q3VMZ","bundle":"https://pith.science/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/bundle.json","state":"https://pith.science/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNV36PAC7IBKLTGSWY273Q3VMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JNV36PAC7IBKLTGSWY273Q3VMZ","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":"2054bc3ddeb2e5722d70aecb89adc17e9578ad96d71b64fe9dc2f94134205193","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-12-09T01:14:02Z","title_canon_sha256":"69402eb72454c45589cb08acea4459aee8900ae7db6bd9ff1852064f15cb01ee"},"schema_version":"1.0","source":{"id":"2412.06126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06126","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06126v1","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06126","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"JNV36PAC7IBK","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"JNV36PAC7IBKLTGS","created_at":"2026-07-05T09:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"JNV36PAC","created_at":"2026-07-05T09:46:15Z"}],"graph_snapshots":[{"event_id":"sha256:addc475feeed15a1deff8cc7a68f54a0b7798113b32c7ff3ccf17118d6c87ba9","target":"graph","created_at":"2026-07-05T09:46:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.06126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Upper Confidence Bound (UCB) algorithms are a widely-used class of sequential algorithms for the $K$-armed bandit problem. Despite extensive research over the past decades aimed at understanding their asymptotic and (near) minimax optimality properties, a precise understanding of their regret behavior remains elusive. This gap has not only hindered the evaluation of their actual algorithmic efficiency, but also limited further developments in statistical inference in sequential data collection.\n  This paper bridges these two fundamental aspects--precise regret analysis and adaptive statistical","authors_text":"Cun-Hui Zhang, Koulik Khamaru, Qiyang Han","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-12-09T01:14:02Z","title":"UCB algorithms for multi-armed bandits: Precise regret and adaptive inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06126","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:eb22ac703e614cdb1486e3b6eed95fab6c7b23cfdef87d13b56d24ecf6d07f3c","target":"record","created_at":"2026-07-05T09:46:15Z","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":"2054bc3ddeb2e5722d70aecb89adc17e9578ad96d71b64fe9dc2f94134205193","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-12-09T01:14:02Z","title_canon_sha256":"69402eb72454c45589cb08acea4459aee8900ae7db6bd9ff1852064f15cb01ee"},"schema_version":"1.0","source":{"id":"2412.06126","kind":"arxiv","version":1}},"canonical_sha256":"4b6bbf3c02fa02a5ccd2b635fdc375667fa281ab36edfa9e9429bdf401cc039b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b6bbf3c02fa02a5ccd2b635fdc375667fa281ab36edfa9e9429bdf401cc039b","first_computed_at":"2026-07-05T09:46:15.757196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:15.757196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCtF4uEweYiruSXpgepN8m1Gv4Xjw3z1aw+GaVOGX0frlTR9VB5xATZtgAfYWZ33uRODHs+S0OS627PsMAZHBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:15.757719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.06126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb22ac703e614cdb1486e3b6eed95fab6c7b23cfdef87d13b56d24ecf6d07f3c","sha256:addc475feeed15a1deff8cc7a68f54a0b7798113b32c7ff3ccf17118d6c87ba9"],"state_sha256":"34dd8ced3867e7573eecbcb85d8087c223974fe5324bd3e7f52ab144a6889e1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wU8Zf1hz+1eYquICALGbT8liLyMt4Im+4m3pwr06C6P3a/PiWhyMeL2ywU6TomcwtmFDuCPrklSeaPR66OCADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:47:21.145477Z","bundle_sha256":"2f1f1c5ee95f97fbc92a4b4c047ab51f68d74c980cf993a177daff61b1b20322"}}