{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ECUIAQ3ZIBNVO4OYTX4BVIIOER","short_pith_number":"pith:ECUIAQ3Z","canonical_record":{"source":{"id":"2307.07539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-14T13:56:11Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"3c015e3847bea55d74e78cdb98adf7f58e3bcfb3bd2fbdf9cb692875080c997a","abstract_canon_sha256":"f0ffaefe9b57517a900d144636b7699d4cf2f09db3ca85103a2c919327e550a7"},"schema_version":"1.0"},"canonical_sha256":"20a8804379405b5771d89df81aa10e245eb707b5888eaba9e218fd9f9e1cde27","source":{"kind":"arxiv","id":"2307.07539","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07539","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07539v2","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07539","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"ECUIAQ3ZIBNV","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_16","alias_value":"ECUIAQ3ZIBNVO4OY","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_8","alias_value":"ECUIAQ3Z","created_at":"2026-07-05T06:40:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ECUIAQ3ZIBNVO4OYTX4BVIIOER","target":"record","payload":{"canonical_record":{"source":{"id":"2307.07539","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-14T13:56:11Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"3c015e3847bea55d74e78cdb98adf7f58e3bcfb3bd2fbdf9cb692875080c997a","abstract_canon_sha256":"f0ffaefe9b57517a900d144636b7699d4cf2f09db3ca85103a2c919327e550a7"},"schema_version":"1.0"},"canonical_sha256":"20a8804379405b5771d89df81aa10e245eb707b5888eaba9e218fd9f9e1cde27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:53.597789Z","signature_b64":"p0TybBwAHRR+6GOA2db4rNDoQGVhwjLyAJTcjkdYJAi5HonvOVSTAAr9EEn/slBL2vInWGFNeeGR7Y8MOZQiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20a8804379405b5771d89df81aa10e245eb707b5888eaba9e218fd9f9e1cde27","last_reissued_at":"2026-07-05T06:40:53.597122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:53.597122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.07539","source_version":2,"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-05T06:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tdp1+sQyjL2XjOFVNirJ2YVz+cYuHZ0iR+hi6TzhttI4Zp/+golOIyvFG3y3zi7IROleLMjm+iB/fPqyOv/pBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T03:22:43.742530Z"},"content_sha256":"7f3d3c80e126590c0dda81fa494fb1ccff24fcb1e0235b1d751718a0a04fa926","schema_version":"1.0","event_id":"sha256:7f3d3c80e126590c0dda81fa494fb1ccff24fcb1e0235b1d751718a0a04fa926"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ECUIAQ3ZIBNVO4OYTX4BVIIOER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sublinear Regret of GP-UCB","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Aaditya Ramdas, Justin Whitehouse, Zhiwei Steven Wu","submitted_at":"2023-07-14T13:56:11Z","abstract_excerpt":"In the kernelized bandit problem, a learner aims to sequentially compute the optimum of a function lying in a reproducing kernel Hilbert space given only noisy evaluations at sequentially chosen points. In particular, the learner aims to minimize regret, which is a measure of the suboptimality of the choices made. Arguably the most popular algorithm is the Gaussian Process Upper Confidence Bound (GP-UCB) algorithm, which involves acting based on a simple linear estimator of the unknown function. Despite its popularity, existing analyses of GP-UCB give a suboptimal regret rate, which fails to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07539","kind":"arxiv","version":2},"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/2307.07539/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-05T06:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ptn8kZbNWa+Is2BYiIftCkkdE5Hj+Z8jj8ax2rQdcsixjV8RCwfWGgQTDXViG1vCk7q6gamY5LfosDD/SlyICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T03:22:43.742919Z"},"content_sha256":"b93ec13070ff6cf2c8af3a4eff3dc5fc88ac6f1b7b74556b19f3de6d57f7f1a5","schema_version":"1.0","event_id":"sha256:b93ec13070ff6cf2c8af3a4eff3dc5fc88ac6f1b7b74556b19f3de6d57f7f1a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/bundle.json","state_url":"https://pith.science/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/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-26T03:22:43Z","links":{"resolver":"https://pith.science/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER","bundle":"https://pith.science/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/bundle.json","state":"https://pith.science/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECUIAQ3ZIBNVO4OYTX4BVIIOER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ECUIAQ3ZIBNVO4OYTX4BVIIOER","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":"f0ffaefe9b57517a900d144636b7699d4cf2f09db3ca85103a2c919327e550a7","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-14T13:56:11Z","title_canon_sha256":"3c015e3847bea55d74e78cdb98adf7f58e3bcfb3bd2fbdf9cb692875080c997a"},"schema_version":"1.0","source":{"id":"2307.07539","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07539","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07539v2","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07539","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"ECUIAQ3ZIBNV","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_16","alias_value":"ECUIAQ3ZIBNVO4OY","created_at":"2026-07-05T06:40:53Z"},{"alias_kind":"pith_short_8","alias_value":"ECUIAQ3Z","created_at":"2026-07-05T06:40:53Z"}],"graph_snapshots":[{"event_id":"sha256:b93ec13070ff6cf2c8af3a4eff3dc5fc88ac6f1b7b74556b19f3de6d57f7f1a5","target":"graph","created_at":"2026-07-05T06:40:53Z","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/2307.07539/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the kernelized bandit problem, a learner aims to sequentially compute the optimum of a function lying in a reproducing kernel Hilbert space given only noisy evaluations at sequentially chosen points. In particular, the learner aims to minimize regret, which is a measure of the suboptimality of the choices made. Arguably the most popular algorithm is the Gaussian Process Upper Confidence Bound (GP-UCB) algorithm, which involves acting based on a simple linear estimator of the unknown function. Despite its popularity, existing analyses of GP-UCB give a suboptimal regret rate, which fails to b","authors_text":"Aaditya Ramdas, Justin Whitehouse, Zhiwei Steven Wu","cross_cats":["math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-14T13:56:11Z","title":"On the Sublinear Regret of GP-UCB"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07539","kind":"arxiv","version":2},"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:7f3d3c80e126590c0dda81fa494fb1ccff24fcb1e0235b1d751718a0a04fa926","target":"record","created_at":"2026-07-05T06:40:53Z","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":"f0ffaefe9b57517a900d144636b7699d4cf2f09db3ca85103a2c919327e550a7","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-07-14T13:56:11Z","title_canon_sha256":"3c015e3847bea55d74e78cdb98adf7f58e3bcfb3bd2fbdf9cb692875080c997a"},"schema_version":"1.0","source":{"id":"2307.07539","kind":"arxiv","version":2}},"canonical_sha256":"20a8804379405b5771d89df81aa10e245eb707b5888eaba9e218fd9f9e1cde27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20a8804379405b5771d89df81aa10e245eb707b5888eaba9e218fd9f9e1cde27","first_computed_at":"2026-07-05T06:40:53.597122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:40:53.597122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0TybBwAHRR+6GOA2db4rNDoQGVhwjLyAJTcjkdYJAi5HonvOVSTAAr9EEn/slBL2vInWGFNeeGR7Y8MOZQiCA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:40:53.597789Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.07539","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f3d3c80e126590c0dda81fa494fb1ccff24fcb1e0235b1d751718a0a04fa926","sha256:b93ec13070ff6cf2c8af3a4eff3dc5fc88ac6f1b7b74556b19f3de6d57f7f1a5"],"state_sha256":"b9ce42e221db456be1f5f105c4939217cfd96e72817f625f4ebc5b3e212cc9ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vuc7Ec2Gcj1TYRZlY9krDYPw2mdS6GXJUS2KsKjfghGxMPOPOv5saOqRMETOY5jXKLyAlFRAyfK5hFGC5c4LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T03:22:43.748668Z","bundle_sha256":"a45199180786263065d79030b466fa65c6ea13c9ab72fc7cfdde26413f073f4f"}}