{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:43LJUAG4XJSAPQJXC4VN4YTVZC","short_pith_number":"pith:43LJUAG4","canonical_record":{"source":{"id":"2012.13115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-24T05:36:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e5b38ea3cf2899394a2eb008e84da65cdde4179a2afbeb17dc32089d05e037c","abstract_canon_sha256":"d623b0638bb05809619a9f57cfdbf20dc0f0b23f3a89acb4e43edcd10aeb77e4"},"schema_version":"1.0"},"canonical_sha256":"e6d69a00dcba6407c137172ade6275c89cf8258461dc38ee0a723e4f2873c068","source":{"kind":"arxiv","id":"2012.13115","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.13115","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"2012.13115v1","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13115","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"43LJUAG4XJSA","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_16","alias_value":"43LJUAG4XJSAPQJX","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_8","alias_value":"43LJUAG4","created_at":"2026-07-05T02:01:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:43LJUAG4XJSAPQJXC4VN4YTVZC","target":"record","payload":{"canonical_record":{"source":{"id":"2012.13115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-24T05:36:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4e5b38ea3cf2899394a2eb008e84da65cdde4179a2afbeb17dc32089d05e037c","abstract_canon_sha256":"d623b0638bb05809619a9f57cfdbf20dc0f0b23f3a89acb4e43edcd10aeb77e4"},"schema_version":"1.0"},"canonical_sha256":"e6d69a00dcba6407c137172ade6275c89cf8258461dc38ee0a723e4f2873c068","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:48.075142Z","signature_b64":"JF/SOllCzbyXNMjFzU3/7fSO0zXXj2Xn/fWpBJQ+rcLZP5/xq/zQhSZYILQeoTUGLZHDV9DEars7Lx6XlPoQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d69a00dcba6407c137172ade6275c89cf8258461dc38ee0a723e4f2873c068","last_reissued_at":"2026-07-05T02:01:48.074654Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:48.074654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.13115","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-05T02:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BEfHw9JVFBihmpJXmxk5fH29g+XHA8pt/hB1HgWtILb2uO9VJOhzw3GoFrznM6y6voodUsVLM5bxqh4BD3jjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:51:27.055680Z"},"content_sha256":"1a45c37adca0e39f902e74232392d2874c290cdf9be31e940e0c799cd1f656c1","schema_version":"1.0","event_id":"sha256:1a45c37adca0e39f902e74232392d2874c290cdf9be31e940e0c799cd1f656c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:43LJUAG4XJSAPQJXC4VN4YTVZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper Confidence Bounds for Combining Stochastic Bandits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhimanyu Das, Ashok Cutkosky, Manish Purohit","submitted_at":"2020-12-24T05:36:29Z","abstract_excerpt":"We provide a simple method to combine stochastic bandit algorithms. Our approach is based on a \"meta-UCB\" procedure that treats each of $N$ individual bandit algorithms as arms in a higher-level $N$-armed bandit problem that we solve with a variant of the classic UCB algorithm. Our final regret depends only on the regret of the base algorithm with the best regret in hindsight. This approach provides an easy and intuitive alternative strategy to the CORRAL algorithm for adversarial bandits, without requiring the stability conditions imposed by CORRAL on the base algorithms. Our results match lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13115","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/2012.13115/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-05T02:01:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq/ao9bWGGiz1NQmJKhBBMQ1N0fiSqGCjb1RB4W0OYXvLSn0FQZWN3XQGTLbEYtmf8LO5Yg0KwwslK0Fea7sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T14:51:27.056583Z"},"content_sha256":"33b846c12f9ce4e7235b3afd3cb17cb6e2af41d784b122af0c73f27dbc34fc82","schema_version":"1.0","event_id":"sha256:33b846c12f9ce4e7235b3afd3cb17cb6e2af41d784b122af0c73f27dbc34fc82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/bundle.json","state_url":"https://pith.science/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/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-14T14:51:27Z","links":{"resolver":"https://pith.science/pith/43LJUAG4XJSAPQJXC4VN4YTVZC","bundle":"https://pith.science/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/bundle.json","state":"https://pith.science/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43LJUAG4XJSAPQJXC4VN4YTVZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:43LJUAG4XJSAPQJXC4VN4YTVZC","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":"d623b0638bb05809619a9f57cfdbf20dc0f0b23f3a89acb4e43edcd10aeb77e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-24T05:36:29Z","title_canon_sha256":"4e5b38ea3cf2899394a2eb008e84da65cdde4179a2afbeb17dc32089d05e037c"},"schema_version":"1.0","source":{"id":"2012.13115","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.13115","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"2012.13115v1","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.13115","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"43LJUAG4XJSA","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_16","alias_value":"43LJUAG4XJSAPQJX","created_at":"2026-07-05T02:01:48Z"},{"alias_kind":"pith_short_8","alias_value":"43LJUAG4","created_at":"2026-07-05T02:01:48Z"}],"graph_snapshots":[{"event_id":"sha256:33b846c12f9ce4e7235b3afd3cb17cb6e2af41d784b122af0c73f27dbc34fc82","target":"graph","created_at":"2026-07-05T02:01:48Z","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/2012.13115/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We provide a simple method to combine stochastic bandit algorithms. Our approach is based on a \"meta-UCB\" procedure that treats each of $N$ individual bandit algorithms as arms in a higher-level $N$-armed bandit problem that we solve with a variant of the classic UCB algorithm. Our final regret depends only on the regret of the base algorithm with the best regret in hindsight. This approach provides an easy and intuitive alternative strategy to the CORRAL algorithm for adversarial bandits, without requiring the stability conditions imposed by CORRAL on the base algorithms. Our results match lo","authors_text":"Abhimanyu Das, Ashok Cutkosky, Manish Purohit","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-24T05:36:29Z","title":"Upper Confidence Bounds for Combining Stochastic Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.13115","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:1a45c37adca0e39f902e74232392d2874c290cdf9be31e940e0c799cd1f656c1","target":"record","created_at":"2026-07-05T02:01:48Z","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":"d623b0638bb05809619a9f57cfdbf20dc0f0b23f3a89acb4e43edcd10aeb77e4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-24T05:36:29Z","title_canon_sha256":"4e5b38ea3cf2899394a2eb008e84da65cdde4179a2afbeb17dc32089d05e037c"},"schema_version":"1.0","source":{"id":"2012.13115","kind":"arxiv","version":1}},"canonical_sha256":"e6d69a00dcba6407c137172ade6275c89cf8258461dc38ee0a723e4f2873c068","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6d69a00dcba6407c137172ade6275c89cf8258461dc38ee0a723e4f2873c068","first_computed_at":"2026-07-05T02:01:48.074654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:01:48.074654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JF/SOllCzbyXNMjFzU3/7fSO0zXXj2Xn/fWpBJQ+rcLZP5/xq/zQhSZYILQeoTUGLZHDV9DEars7Lx6XlPoQCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:01:48.075142Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.13115","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a45c37adca0e39f902e74232392d2874c290cdf9be31e940e0c799cd1f656c1","sha256:33b846c12f9ce4e7235b3afd3cb17cb6e2af41d784b122af0c73f27dbc34fc82"],"state_sha256":"f064841c118b83cdb8907f9b1f95aaaad2b7d5c73591fd7986b7bba5f8b89c44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR6RLAbwlmPlpt4I7PbI/kKcTwia0fnjEZkvfhjNxFO8cW0O7G8Wa57SSUepbv/DC0j7tcF3bKOFW4K/PNwVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T14:51:27.063879Z","bundle_sha256":"6a6e351d67af07ddce47a029103a4e14b5df0ee01a98cf3deaeafb3b31341cd5"}}