{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BGTYZ2ZJVVQ5JMTWF7QIPPJSFP","short_pith_number":"pith:BGTYZ2ZJ","canonical_record":{"source":{"id":"1206.6457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2c9364d50d289b8f1bf4af7e33e4e30da63628158253a6017d5e4d57eee351ef","abstract_canon_sha256":"74883b11cea707f3f92c78023bca9728ebb026e3a5b0064640281ca8f40d1af7"},"schema_version":"1.0"},"canonical_sha256":"09a78ceb29ad61d4b2762fe087bd322bfaacec71c68e8209b285bd663fa34b3f","source":{"kind":"arxiv","id":"1206.6457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6457","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6457v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6457","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"BGTYZ2ZJVVQ5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BGTYZ2ZJVVQ5JMTW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BGTYZ2ZJ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BGTYZ2ZJVVQ5JMTWF7QIPPJSFP","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2c9364d50d289b8f1bf4af7e33e4e30da63628158253a6017d5e4d57eee351ef","abstract_canon_sha256":"74883b11cea707f3f92c78023bca9728ebb026e3a5b0064640281ca8f40d1af7"},"schema_version":"1.0"},"canonical_sha256":"09a78ceb29ad61d4b2762fe087bd322bfaacec71c68e8209b285bd663fa34b3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:13.935741Z","signature_b64":"UXJ9Wv6kZXCMwcyfg9P7/J9zl3+dI6kzZPMY71pakX9nXXmlBnsz5Ipce1yXhLLVtR6WrP+zexvKrZJHCQAWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a78ceb29ad61d4b2762fe087bd322bfaacec71c68e8209b285bd663fa34b3f","last_reissued_at":"2026-05-18T03:52:13.935064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:13.935064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6457","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-18T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5R82JRsq+CK7srirJj7hal9/CqOFzY29EeoSxGGJrMolQKaYfXbWxqjP/UlETtDeFY1PlPg2ex6kQkoDkkcICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:20.694849Z"},"content_sha256":"680dde9fd0d819c955d33c45948d46ec4dc09b1dcec011d168b7398dc45ede85","schema_version":"1.0","event_id":"sha256:680dde9fd0d819c955d33c45948d46ec4dc09b1dcec011d168b7398dc45ede85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BGTYZ2ZJVVQ5JMTWF7QIPPJSFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola (Yahoo! Research), Masrour Zoghi (University of British Columbia), Nando de Freitas (University of British Columbia)","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"This paper analyzes the problem of Gaussian process (GP) bandits with deterministic observations. The analysis uses a branch and bound algorithm that is related to the UCB algorithm of (Srinivas et al, 2010). For GPs with Gaussian observation noise, with variance strictly greater than zero, Srinivas et al proved that the regret vanishes at the approximate rate of $O(1/\\sqrt{t})$, where t is the number of observations. To complement their result, we attack the deterministic case and attain a much faster exponential convergence rate. Under some regularity assumptions, we show that the regret dec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6457","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-18T03:52:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB3O2jOosE7gbi2kzUwqrHHiRs98N2yjrowm8cwtUF9fHXIEOJaJlA+x8HFwTTSuoC07GTKuS6V7zm/HzBaJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:59:20.695529Z"},"content_sha256":"692dc20b0ab5da47e613699da8b89273bf1b489c9bccba1e915edd560ca3bb89","schema_version":"1.0","event_id":"sha256:692dc20b0ab5da47e613699da8b89273bf1b489c9bccba1e915edd560ca3bb89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/bundle.json","state_url":"https://pith.science/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/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-06-06T15:59:20Z","links":{"resolver":"https://pith.science/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP","bundle":"https://pith.science/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/bundle.json","state":"https://pith.science/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGTYZ2ZJVVQ5JMTWF7QIPPJSFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BGTYZ2ZJVVQ5JMTWF7QIPPJSFP","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":"74883b11cea707f3f92c78023bca9728ebb026e3a5b0064640281ca8f40d1af7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"2c9364d50d289b8f1bf4af7e33e4e30da63628158253a6017d5e4d57eee351ef"},"schema_version":"1.0","source":{"id":"1206.6457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6457","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6457v1","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6457","created_at":"2026-05-18T03:52:13Z"},{"alias_kind":"pith_short_12","alias_value":"BGTYZ2ZJVVQ5","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"BGTYZ2ZJVVQ5JMTW","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"BGTYZ2ZJ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:692dc20b0ab5da47e613699da8b89273bf1b489c9bccba1e915edd560ca3bb89","target":"graph","created_at":"2026-05-18T03:52:13Z","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":"This paper analyzes the problem of Gaussian process (GP) bandits with deterministic observations. The analysis uses a branch and bound algorithm that is related to the UCB algorithm of (Srinivas et al, 2010). For GPs with Gaussian observation noise, with variance strictly greater than zero, Srinivas et al proved that the regret vanishes at the approximate rate of $O(1/\\sqrt{t})$, where t is the number of observations. To complement their result, we attack the deterministic case and attain a much faster exponential convergence rate. Under some regularity assumptions, we show that the regret dec","authors_text":"Alex Smola (Yahoo! Research), Masrour Zoghi (University of British Columbia), Nando de Freitas (University of British Columbia)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6457","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:680dde9fd0d819c955d33c45948d46ec4dc09b1dcec011d168b7398dc45ede85","target":"record","created_at":"2026-05-18T03:52:13Z","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":"74883b11cea707f3f92c78023bca9728ebb026e3a5b0064640281ca8f40d1af7","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"2c9364d50d289b8f1bf4af7e33e4e30da63628158253a6017d5e4d57eee351ef"},"schema_version":"1.0","source":{"id":"1206.6457","kind":"arxiv","version":1}},"canonical_sha256":"09a78ceb29ad61d4b2762fe087bd322bfaacec71c68e8209b285bd663fa34b3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09a78ceb29ad61d4b2762fe087bd322bfaacec71c68e8209b285bd663fa34b3f","first_computed_at":"2026-05-18T03:52:13.935064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:13.935064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UXJ9Wv6kZXCMwcyfg9P7/J9zl3+dI6kzZPMY71pakX9nXXmlBnsz5Ipce1yXhLLVtR6WrP+zexvKrZJHCQAWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:13.935741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:680dde9fd0d819c955d33c45948d46ec4dc09b1dcec011d168b7398dc45ede85","sha256:692dc20b0ab5da47e613699da8b89273bf1b489c9bccba1e915edd560ca3bb89"],"state_sha256":"b7e080ade1e17efa34acbd53fe725aa4d6eae9a7435823822f23bbbc91d9d513"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuazektsURoVatYwtGIqITJ1BcVtXi6kUtmMHFy0X50vVLFa1x2Tlh3iT5RddpCmcE0pddAB/+trRBNL0jzsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:59:20.698133Z","bundle_sha256":"d521699b762d88cb6290d44bf2672f33db4532d4a8ada98c00a554f717ccbfb4"}}