{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R5MLNIKI6PTPL7BNS4WB6GMJPH","short_pith_number":"pith:R5MLNIKI","canonical_record":{"source":{"id":"1203.2177","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-03-09T20:51:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"36c2b9e0c63b70dd0126b354d1f0be7eab64bbb4ac3fe3ab7c9451072f00f944","abstract_canon_sha256":"a0b3cf59e7e1a61f3faec15a8b5803546a5c9c73ac700ab2d6517ecbc55ab954"},"schema_version":"1.0"},"canonical_sha256":"8f58b6a148f3e6f5fc2d972c1f198979fd0965e55704d45516217bd77a9f545d","source":{"kind":"arxiv","id":"1203.2177","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2177","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2177v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2177","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"R5MLNIKI6PTP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R5MLNIKI6PTPL7BN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R5MLNIKI","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R5MLNIKI6PTPL7BNS4WB6GMJPH","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2177","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-03-09T20:51:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"36c2b9e0c63b70dd0126b354d1f0be7eab64bbb4ac3fe3ab7c9451072f00f944","abstract_canon_sha256":"a0b3cf59e7e1a61f3faec15a8b5803546a5c9c73ac700ab2d6517ecbc55ab954"},"schema_version":"1.0"},"canonical_sha256":"8f58b6a148f3e6f5fc2d972c1f198979fd0965e55704d45516217bd77a9f545d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:27.314426Z","signature_b64":"AmiQcqGnxC76YBC1aA7UkNLMrodOxV5GfXDencABU1dxqkkBFreZU67RUO/A/uHcgVEip2BWwCMUN8/x280sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f58b6a148f3e6f5fc2d972c1f198979fd0965e55704d45516217bd77a9f545d","last_reissued_at":"2026-05-18T04:00:27.313962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:27.313962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2177","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-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/miAN4htQiVGAkgyieibvIFuSGGEaV3jsfnpQpPpjUXYAMmos8nFebatec4zRDpDYvUOAn3xf4TD7bIZo7QBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:36.252166Z"},"content_sha256":"9a7d40e7c6a76d93779c80917f42d6593dde48db23324410d8e4944c80494e03","schema_version":"1.0","event_id":"sha256:9a7d40e7c6a76d93779c80917f42d6593dde48db23324410d8e4944c80494e03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R5MLNIKI6PTPL7BNS4WB6GMJPH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regret Bounds for Deterministic Gaussian Process Bandits","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex Smola, Masrour Zoghi, Nando de Freitas","submitted_at":"2012-03-09T20:51:37Z","abstract_excerpt":"This paper analyses 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., 2010) proved that the regret vanishes at the approximate rate of $O(\\frac{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 t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2177","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-18T04:00:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXIIIecHDcft0pCPnoCSba7PhPpVkw0BCIdGHJDQ7xzbQQnvRunuZDJYdVg9ckIolIXN0hGYDAWSvo5eIGzzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:36.252528Z"},"content_sha256":"f4208720be4f25055b025a17213045e0019c8d04c946093c9f2e5cab1b938ef5","schema_version":"1.0","event_id":"sha256:f4208720be4f25055b025a17213045e0019c8d04c946093c9f2e5cab1b938ef5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/bundle.json","state_url":"https://pith.science/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/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-03T22:08:36Z","links":{"resolver":"https://pith.science/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH","bundle":"https://pith.science/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/bundle.json","state":"https://pith.science/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R5MLNIKI6PTPL7BNS4WB6GMJPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R5MLNIKI6PTPL7BNS4WB6GMJPH","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":"a0b3cf59e7e1a61f3faec15a8b5803546a5c9c73ac700ab2d6517ecbc55ab954","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-03-09T20:51:37Z","title_canon_sha256":"36c2b9e0c63b70dd0126b354d1f0be7eab64bbb4ac3fe3ab7c9451072f00f944"},"schema_version":"1.0","source":{"id":"1203.2177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2177","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2177v1","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2177","created_at":"2026-05-18T04:00:27Z"},{"alias_kind":"pith_short_12","alias_value":"R5MLNIKI6PTP","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R5MLNIKI6PTPL7BN","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R5MLNIKI","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:f4208720be4f25055b025a17213045e0019c8d04c946093c9f2e5cab1b938ef5","target":"graph","created_at":"2026-05-18T04:00:27Z","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 analyses 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., 2010) proved that the regret vanishes at the approximate rate of $O(\\frac{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 t","authors_text":"Alex Smola, Masrour Zoghi, Nando de Freitas","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-03-09T20:51:37Z","title":"Regret Bounds for Deterministic Gaussian Process Bandits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2177","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:9a7d40e7c6a76d93779c80917f42d6593dde48db23324410d8e4944c80494e03","target":"record","created_at":"2026-05-18T04:00:27Z","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":"a0b3cf59e7e1a61f3faec15a8b5803546a5c9c73ac700ab2d6517ecbc55ab954","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.LG","submitted_at":"2012-03-09T20:51:37Z","title_canon_sha256":"36c2b9e0c63b70dd0126b354d1f0be7eab64bbb4ac3fe3ab7c9451072f00f944"},"schema_version":"1.0","source":{"id":"1203.2177","kind":"arxiv","version":1}},"canonical_sha256":"8f58b6a148f3e6f5fc2d972c1f198979fd0965e55704d45516217bd77a9f545d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f58b6a148f3e6f5fc2d972c1f198979fd0965e55704d45516217bd77a9f545d","first_computed_at":"2026-05-18T04:00:27.313962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:27.313962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AmiQcqGnxC76YBC1aA7UkNLMrodOxV5GfXDencABU1dxqkkBFreZU67RUO/A/uHcgVEip2BWwCMUN8/x280sBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:27.314426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a7d40e7c6a76d93779c80917f42d6593dde48db23324410d8e4944c80494e03","sha256:f4208720be4f25055b025a17213045e0019c8d04c946093c9f2e5cab1b938ef5"],"state_sha256":"6fa25ec9b1ad4efd6be16bfd4f0a937239cbff7bf5cf5f2ceaa7b37b00ec83ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CTjarj6jW3RsM2r/GqvdPpxmux2ydPEp7p/D6eFo57jg4RXGFMjIE7LpY6gEK+yOSx3cQoJZc1R2UUAXui/tAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:08:36.254504Z","bundle_sha256":"220580852310680d729b0778cfc91a849351aa7aeaff45f34aeb70c1d4e28e3c"}}