{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EAHDIPXEBQKHENNVMFDNJ6W7DH","short_pith_number":"pith:EAHDIPXE","canonical_record":{"source":{"id":"1804.05929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3f0e591712354cb8d8edb253c9db244e9b0f6f3b0e9f94c87053b958a57653e2","abstract_canon_sha256":"4ab5d2f6c9cd15db8ffb8002dc6e27d603287114a1e73709a7aa77bfa718e984"},"schema_version":"1.0"},"canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","source":{"kind":"arxiv","id":"1804.05929","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05929","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05929v1","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05929","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"EAHDIPXEBQKH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EAHDIPXEBQKHENNV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EAHDIPXE","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EAHDIPXEBQKHENNVMFDNJ6W7DH","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05929","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"3f0e591712354cb8d8edb253c9db244e9b0f6f3b0e9f94c87053b958a57653e2","abstract_canon_sha256":"4ab5d2f6c9cd15db8ffb8002dc6e27d603287114a1e73709a7aa77bfa718e984"},"schema_version":"1.0"},"canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:22.323229Z","signature_b64":"vDTcbievhpZ2McEj5RoI26H/PkacimhOL1ZexFmfF21AMTSEpQ2uStabQHjv1yaAw0S+vG9F36WIyol7pcHzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","last_reissued_at":"2026-05-18T00:18:22.322525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:22.322525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05929","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:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tSZ3IKT2Q7eUFPP5fLbnuDwJv0prbkBQiwMMsM23yw3/+IwNGBfh8BJpJp6kpqElg8f6i+zIeKRjtYI5qFSXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:35:02.090767Z"},"content_sha256":"cfca005c9acc125ec7c4bcc9f5deb6d69abad741dc6a41b7363ad7e566586f20","schema_version":"1.0","event_id":"sha256:cfca005c9acc125ec7c4bcc9f5deb6d69abad741dc6a41b7363ad7e566586f20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EAHDIPXEBQKHENNVMFDNJ6W7DH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Fang Liu, Ness Shroff, Sinong Wang, Swapna Buccapatnam","submitted_at":"2018-04-16T20:44:28Z","abstract_excerpt":"In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost($D$) enjoys $O(1)$ complexity for each arm per round as well as regret guarantee that is $1/e$-close to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05929","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:18:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hWefKUOB+n8bnKa2PfjPgY2YQxFgI7ldsFWjaiq68vIdSa2/7J37Mjt4dvBhw/ikiw5cq5IICwVsHuKAbwKrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:35:02.091449Z"},"content_sha256":"993e7f0b30ed984814e0496f68e9ba41bcfe1dd365001fca6ee9c39f25ebf1d9","schema_version":"1.0","event_id":"sha256:993e7f0b30ed984814e0496f68e9ba41bcfe1dd365001fca6ee9c39f25ebf1d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/bundle.json","state_url":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/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-26T21:35:02Z","links":{"resolver":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH","bundle":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/bundle.json","state":"https://pith.science/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAHDIPXEBQKHENNVMFDNJ6W7DH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EAHDIPXEBQKHENNVMFDNJ6W7DH","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":"4ab5d2f6c9cd15db8ffb8002dc6e27d603287114a1e73709a7aa77bfa718e984","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","title_canon_sha256":"3f0e591712354cb8d8edb253c9db244e9b0f6f3b0e9f94c87053b958a57653e2"},"schema_version":"1.0","source":{"id":"1804.05929","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05929","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05929v1","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05929","created_at":"2026-05-18T00:18:22Z"},{"alias_kind":"pith_short_12","alias_value":"EAHDIPXEBQKH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EAHDIPXEBQKHENNV","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EAHDIPXE","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:993e7f0b30ed984814e0496f68e9ba41bcfe1dd365001fca6ee9c39f25ebf1d9","target":"graph","created_at":"2026-05-18T00:18:22Z","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":"In this work, we address the open problem of finding low-complexity near-optimal multi-armed bandit algorithms for sequential decision making problems. Existing bandit algorithms are either sub-optimal and computationally simple (e.g., UCB1) or optimal and computationally complex (e.g., kl-UCB). We propose a boosting approach to Upper Confidence Bound based algorithms for stochastic bandits, that we call UCBoost. Specifically, we propose two types of UCBoost algorithms. We show that UCBoost($D$) enjoys $O(1)$ complexity for each arm per round as well as regret guarantee that is $1/e$-close to ","authors_text":"Fang Liu, Ness Shroff, Sinong Wang, Swapna Buccapatnam","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","title":"UCBoost: A Boosting Approach to Tame Complexity and Optimality for Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05929","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:cfca005c9acc125ec7c4bcc9f5deb6d69abad741dc6a41b7363ad7e566586f20","target":"record","created_at":"2026-05-18T00:18:22Z","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":"4ab5d2f6c9cd15db8ffb8002dc6e27d603287114a1e73709a7aa77bfa718e984","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-04-16T20:44:28Z","title_canon_sha256":"3f0e591712354cb8d8edb253c9db244e9b0f6f3b0e9f94c87053b958a57653e2"},"schema_version":"1.0","source":{"id":"1804.05929","kind":"arxiv","version":1}},"canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"200e343ee40c147235b56146d4fadf19f7c0d1a1ab3d0a70716c30ae69b09626","first_computed_at":"2026-05-18T00:18:22.322525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:22.322525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vDTcbievhpZ2McEj5RoI26H/PkacimhOL1ZexFmfF21AMTSEpQ2uStabQHjv1yaAw0S+vG9F36WIyol7pcHzAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:22.323229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05929","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfca005c9acc125ec7c4bcc9f5deb6d69abad741dc6a41b7363ad7e566586f20","sha256:993e7f0b30ed984814e0496f68e9ba41bcfe1dd365001fca6ee9c39f25ebf1d9"],"state_sha256":"70abb8e22e9968494b56bc1028a1bb35078fe6a93a3df957e7457a837d8c738c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rDbta2Fr2EjAwPrRdRFFM846cDoLuf5FcZAXn9Eje2EPCpUbyvLbxObDOhkZ7YjLnLGp4vWgnwYZfnYj3a1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:35:02.095461Z","bundle_sha256":"b7f0bf96d04e9a4e5a9f2920179eab8d62c25bd201c4f4d9abe2d33ebf524890"}}