{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SBPE66KTGWMTHF2VUZ37XHDTLX","short_pith_number":"pith:SBPE66KT","canonical_record":{"source":{"id":"1906.05247","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T17:11:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6f453b18c7c55708ab7d9306481c26c86d75a7a7ff5f9ced88c1cc1f54d0fced","abstract_canon_sha256":"59bbe5a55d42a650a1716a979bdba308e311b6df823f07656fa8b85c202f7f20"},"schema_version":"1.0"},"canonical_sha256":"905e4f79533599339755a677fb9c735deaded7bea32ab170b7767f06a2cadcbd","source":{"kind":"arxiv","id":"1906.05247","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05247","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05247v3","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05247","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"SBPE66KTGWMT","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_16","alias_value":"SBPE66KTGWMTHF2V","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_8","alias_value":"SBPE66KT","created_at":"2026-07-05T00:16:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SBPE66KTGWMTHF2VUZ37XHDTLX","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05247","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T17:11:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6f453b18c7c55708ab7d9306481c26c86d75a7a7ff5f9ced88c1cc1f54d0fced","abstract_canon_sha256":"59bbe5a55d42a650a1716a979bdba308e311b6df823f07656fa8b85c202f7f20"},"schema_version":"1.0"},"canonical_sha256":"905e4f79533599339755a677fb9c735deaded7bea32ab170b7767f06a2cadcbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:04.262085Z","signature_b64":"bDCphWd5u7ZDkngVXFNB3iJXffy46O3CszjM7tbf3IndlPUvmQ3EXU3qhDRy0sfQKzhuTQuil11jGhMZudGGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"905e4f79533599339755a677fb9c735deaded7bea32ab170b7767f06a2cadcbd","last_reissued_at":"2026-07-05T00:16:04.261687Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:04.261687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05247","source_version":3,"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-05T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btPlT0hpf69QUEQbSbg7Mz6OmUiy4JvcmveKsZJfo9i+hY9qoseS4EyjyjNfaVxsLBOOlvInU8i6uPnxmleiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:07:29.886904Z"},"content_sha256":"da56c1eed3ab6498269b7b56ff1eceee20bb34097dc42e4e897a1f5f771a4d11","schema_version":"1.0","event_id":"sha256:da56c1eed3ab6498269b7b56ff1eceee20bb34097dc42e4e897a1f5f771a4d11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SBPE66KTGWMTHF2VUZ37XHDTLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bootstrapping Upper Confidence Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Botao Hao, Guang Cheng, Yasin Abbasi-Yadkori, Zheng Wen","submitted_at":"2019-06-12T17:11:41Z","abstract_excerpt":"Upper Confidence Bound (UCB) method is arguably the most celebrated one used in online decision making with partial information feedback. Existing techniques for constructing confidence bounds are typically built upon various concentration inequalities, which thus lead to over-exploration. In this paper, we propose a non-parametric and data-dependent UCB algorithm based on the multiplier bootstrap. To improve its finite sample performance, we further incorporate second-order correction into the above construction. In theory, we derive both problem-dependent and problem-independent regret bound"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05247","kind":"arxiv","version":3},"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/1906.05247/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-05T00:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMafh2D1iH1IJMoWfrKSQf9+BUSibv9CmHkHyhQOTOly9aadffTib5eSvwBFsnHZbwrKe958JLJyMtzzcc3CCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T00:07:29.887477Z"},"content_sha256":"6b6b382eaf1a18ae184efc37cd5b9f0bbb7b957c097ebc9b01dae6aafe189c09","schema_version":"1.0","event_id":"sha256:6b6b382eaf1a18ae184efc37cd5b9f0bbb7b957c097ebc9b01dae6aafe189c09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/bundle.json","state_url":"https://pith.science/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/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-08-07T00:07:29Z","links":{"resolver":"https://pith.science/pith/SBPE66KTGWMTHF2VUZ37XHDTLX","bundle":"https://pith.science/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/bundle.json","state":"https://pith.science/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBPE66KTGWMTHF2VUZ37XHDTLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SBPE66KTGWMTHF2VUZ37XHDTLX","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":"59bbe5a55d42a650a1716a979bdba308e311b6df823f07656fa8b85c202f7f20","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T17:11:41Z","title_canon_sha256":"6f453b18c7c55708ab7d9306481c26c86d75a7a7ff5f9ced88c1cc1f54d0fced"},"schema_version":"1.0","source":{"id":"1906.05247","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05247","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05247v3","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05247","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"SBPE66KTGWMT","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_16","alias_value":"SBPE66KTGWMTHF2V","created_at":"2026-07-05T00:16:04Z"},{"alias_kind":"pith_short_8","alias_value":"SBPE66KT","created_at":"2026-07-05T00:16:04Z"}],"graph_snapshots":[{"event_id":"sha256:6b6b382eaf1a18ae184efc37cd5b9f0bbb7b957c097ebc9b01dae6aafe189c09","target":"graph","created_at":"2026-07-05T00:16:04Z","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/1906.05247/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Upper Confidence Bound (UCB) method is arguably the most celebrated one used in online decision making with partial information feedback. Existing techniques for constructing confidence bounds are typically built upon various concentration inequalities, which thus lead to over-exploration. In this paper, we propose a non-parametric and data-dependent UCB algorithm based on the multiplier bootstrap. To improve its finite sample performance, we further incorporate second-order correction into the above construction. In theory, we derive both problem-dependent and problem-independent regret bound","authors_text":"Botao Hao, Guang Cheng, Yasin Abbasi-Yadkori, Zheng Wen","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T17:11:41Z","title":"Bootstrapping Upper Confidence Bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05247","kind":"arxiv","version":3},"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:da56c1eed3ab6498269b7b56ff1eceee20bb34097dc42e4e897a1f5f771a4d11","target":"record","created_at":"2026-07-05T00:16:04Z","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":"59bbe5a55d42a650a1716a979bdba308e311b6df823f07656fa8b85c202f7f20","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-12T17:11:41Z","title_canon_sha256":"6f453b18c7c55708ab7d9306481c26c86d75a7a7ff5f9ced88c1cc1f54d0fced"},"schema_version":"1.0","source":{"id":"1906.05247","kind":"arxiv","version":3}},"canonical_sha256":"905e4f79533599339755a677fb9c735deaded7bea32ab170b7767f06a2cadcbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"905e4f79533599339755a677fb9c735deaded7bea32ab170b7767f06a2cadcbd","first_computed_at":"2026-07-05T00:16:04.261687Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:16:04.261687Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bDCphWd5u7ZDkngVXFNB3iJXffy46O3CszjM7tbf3IndlPUvmQ3EXU3qhDRy0sfQKzhuTQuil11jGhMZudGGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:16:04.262085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05247","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da56c1eed3ab6498269b7b56ff1eceee20bb34097dc42e4e897a1f5f771a4d11","sha256:6b6b382eaf1a18ae184efc37cd5b9f0bbb7b957c097ebc9b01dae6aafe189c09"],"state_sha256":"e6b0f50b24da25b629ec26484959f24c7016f12b3c24a29ee5a1d20b17fc13ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAnijtFvAJeSkz9iLXGHF1Q0WQnQY0X484ayb8kFEOGYTlZ25kA8srwwtBLBrJM9abFh9HrzyZAIBMWuNg9dBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T00:07:29.891564Z","bundle_sha256":"2389cc0dcc5292023e25d2e0fff05f149ce508db538fd8b265e2b3bbb70c9cab"}}