{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LOTIHLVFEJLIHYN2GTOGNW5TOY","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":"cfdb4c9eb7e58fc2ed1308129e1b1cafdbc282da57325c2820d0c493ae99ce09","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-08-20T03:48:14Z","title_canon_sha256":"c6264bdb0cc5be97298b62d9a65e498b8d52ed62809ff8d505f4f8673abf2485"},"schema_version":"1.0","source":{"id":"2008.08757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2008.08757","created_at":"2026-07-05T02:42:26Z"},{"alias_kind":"arxiv_version","alias_value":"2008.08757v2","created_at":"2026-07-05T02:42:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.08757","created_at":"2026-07-05T02:42:26Z"},{"alias_kind":"pith_short_12","alias_value":"LOTIHLVFEJLI","created_at":"2026-07-05T02:42:26Z"},{"alias_kind":"pith_short_16","alias_value":"LOTIHLVFEJLIHYN2","created_at":"2026-07-05T02:42:26Z"},{"alias_kind":"pith_short_8","alias_value":"LOTIHLVF","created_at":"2026-07-05T02:42:26Z"}],"graph_snapshots":[{"event_id":"sha256:0b5f147f073a9c5b7dedda856c820a0b780e6188f7314120953f2eff54dfb157","target":"graph","created_at":"2026-07-05T02:42:26Z","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/2008.08757/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we consider algorithm-independent lower bounds for the problem of black-box optimization of functions having a bounded norm is some Reproducing Kernel Hilbert Space (RKHS), which can be viewed as a non-Bayesian Gaussian process bandit problem. In the standard noisy setting, we provide a novel proof technique for deriving lower bounds on the regret, with benefits including simplicity, versatility, and an improved dependence on the error probability. In a robust setting in which every sampled point may be perturbed by a suitably-constrained adversary, we provide a novel lower boun","authors_text":"Jonathan Scarlett, Xu Cai","cross_cats":["cs.IT","cs.LG","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-08-20T03:48:14Z","title":"On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.08757","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:859424ee139c0fbe376bb54157185a8d776b05256606c3d4721428d2b5ae53c7","target":"record","created_at":"2026-07-05T02:42:26Z","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":"cfdb4c9eb7e58fc2ed1308129e1b1cafdbc282da57325c2820d0c493ae99ce09","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-08-20T03:48:14Z","title_canon_sha256":"c6264bdb0cc5be97298b62d9a65e498b8d52ed62809ff8d505f4f8673abf2485"},"schema_version":"1.0","source":{"id":"2008.08757","kind":"arxiv","version":2}},"canonical_sha256":"5ba683aea5225683e1ba34dc66dbb37605084843e4db8cb67a4afeb5523791e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba683aea5225683e1ba34dc66dbb37605084843e4db8cb67a4afeb5523791e9","first_computed_at":"2026-07-05T02:42:26.441730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:42:26.441730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTqJy/r/sbSIGg3rfa3KxbmU5LWz1MqVIOJnflvK/WeX06vtNHHv/05fkWdC/0DnOIX5mmwqe96XZVgYPPIGBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:42:26.442212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2008.08757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:859424ee139c0fbe376bb54157185a8d776b05256606c3d4721428d2b5ae53c7","sha256:0b5f147f073a9c5b7dedda856c820a0b780e6188f7314120953f2eff54dfb157"],"state_sha256":"b69e11cc9c5241b009f69a1df8bc3751bb7ed808776bbdf7bca247fd906c53f5"}