{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:UBXT5YHEQRPSA7FNWFVMWZN6SO","short_pith_number":"pith:UBXT5YHE","canonical_record":{"source":{"id":"2402.16811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-02-26T18:34:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d14568e1aa1688dd3e2c00b2ce27612cff91788360d1a5a1fdf45935ad8db178","abstract_canon_sha256":"96f29daa1b306f6832b8120c6110bba8305e5196d25c97512c526842b1d8da94"},"schema_version":"1.0"},"canonical_sha256":"a06f3ee0e4845f207cadb16acb65be938811e42466062736bde055093aa745cd","source":{"kind":"arxiv","id":"2402.16811","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.16811","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"arxiv_version","alias_value":"2402.16811v2","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16811","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_12","alias_value":"UBXT5YHEQRPS","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_16","alias_value":"UBXT5YHEQRPSA7FN","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_8","alias_value":"UBXT5YHE","created_at":"2026-07-05T09:47:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:UBXT5YHEQRPSA7FNWFVMWZN6SO","target":"record","payload":{"canonical_record":{"source":{"id":"2402.16811","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-02-26T18:34:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d14568e1aa1688dd3e2c00b2ce27612cff91788360d1a5a1fdf45935ad8db178","abstract_canon_sha256":"96f29daa1b306f6832b8120c6110bba8305e5196d25c97512c526842b1d8da94"},"schema_version":"1.0"},"canonical_sha256":"a06f3ee0e4845f207cadb16acb65be938811e42466062736bde055093aa745cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:28.559396Z","signature_b64":"wVhtXEsb9zeEyfF3FkQzzpFi+RD9bYGtPfj1jhCSHWY//lrbuckW/BrX5RXMdzFt9DVEuXiDR8EgjJm6bfSICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a06f3ee0e4845f207cadb16acb65be938811e42466062736bde055093aa745cd","last_reissued_at":"2026-07-05T09:47:28.558870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:28.558870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.16811","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-05T09:47:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/pe6ngGucX9i71HxTxbK4YLOn4SAhELcuScQ1h2eKBLxzvBn9hTfvfTTbj3o7/bSzBzyu8LCvtMo4kjc/hKvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:17:48.902348Z"},"content_sha256":"00e1c5e1c6aae30c44d65c425b373214818c22980600197c3be81d08dc707c66","schema_version":"1.0","event_id":"sha256:00e1c5e1c6aae30c44d65c425b373214818c22980600197c3be81d08dc707c66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:UBXT5YHEQRPSA7FNWFVMWZN6SO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stopping Bayesian Optimization with Probabilistic Regret Bounds","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"James T. Wilson","submitted_at":"2024-02-26T18:34:58Z","abstract_excerpt":"Bayesian optimization is a popular framework for efficiently tackling black-box search problems. As a rule, these algorithms operate by iteratively choosing what to evaluate next until some predefined budget has been exhausted. We investigate replacing this de facto stopping rule with criteria based on the probability that a point satisfies a given set of conditions. We focus on the prototypical example of an $(\\epsilon, \\delta)$-criterion: stop when a solution has been found whose value is within $\\epsilon > 0$ of the optimum with probability at least $1 - \\delta$ under the model. For Gaussia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16811","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/2402.16811/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-05T09:47:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XCPWBnQK6J+UwnIiy1J5Qr/0QzXCWsa7CseAsW+jVVHENT31Mz79T7IfxdheYGEKk/rWRsCtMswlbddDgdmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:17:48.902876Z"},"content_sha256":"039cd6bf853a65375b8d798df7b9b1e42c4ee92075612407ac5c665389665415","schema_version":"1.0","event_id":"sha256:039cd6bf853a65375b8d798df7b9b1e42c4ee92075612407ac5c665389665415"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/bundle.json","state_url":"https://pith.science/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/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-13T18:17:48Z","links":{"resolver":"https://pith.science/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO","bundle":"https://pith.science/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/bundle.json","state":"https://pith.science/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBXT5YHEQRPSA7FNWFVMWZN6SO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:UBXT5YHEQRPSA7FNWFVMWZN6SO","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":"96f29daa1b306f6832b8120c6110bba8305e5196d25c97512c526842b1d8da94","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-02-26T18:34:58Z","title_canon_sha256":"d14568e1aa1688dd3e2c00b2ce27612cff91788360d1a5a1fdf45935ad8db178"},"schema_version":"1.0","source":{"id":"2402.16811","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.16811","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"arxiv_version","alias_value":"2402.16811v2","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.16811","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_12","alias_value":"UBXT5YHEQRPS","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_16","alias_value":"UBXT5YHEQRPSA7FN","created_at":"2026-07-05T09:47:28Z"},{"alias_kind":"pith_short_8","alias_value":"UBXT5YHE","created_at":"2026-07-05T09:47:28Z"}],"graph_snapshots":[{"event_id":"sha256:039cd6bf853a65375b8d798df7b9b1e42c4ee92075612407ac5c665389665415","target":"graph","created_at":"2026-07-05T09:47:28Z","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/2402.16811/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bayesian optimization is a popular framework for efficiently tackling black-box search problems. As a rule, these algorithms operate by iteratively choosing what to evaluate next until some predefined budget has been exhausted. We investigate replacing this de facto stopping rule with criteria based on the probability that a point satisfies a given set of conditions. We focus on the prototypical example of an $(\\epsilon, \\delta)$-criterion: stop when a solution has been found whose value is within $\\epsilon > 0$ of the optimum with probability at least $1 - \\delta$ under the model. For Gaussia","authors_text":"James T. Wilson","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-02-26T18:34:58Z","title":"Stopping Bayesian Optimization with Probabilistic Regret Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.16811","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:00e1c5e1c6aae30c44d65c425b373214818c22980600197c3be81d08dc707c66","target":"record","created_at":"2026-07-05T09:47:28Z","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":"96f29daa1b306f6832b8120c6110bba8305e5196d25c97512c526842b1d8da94","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-02-26T18:34:58Z","title_canon_sha256":"d14568e1aa1688dd3e2c00b2ce27612cff91788360d1a5a1fdf45935ad8db178"},"schema_version":"1.0","source":{"id":"2402.16811","kind":"arxiv","version":2}},"canonical_sha256":"a06f3ee0e4845f207cadb16acb65be938811e42466062736bde055093aa745cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a06f3ee0e4845f207cadb16acb65be938811e42466062736bde055093aa745cd","first_computed_at":"2026-07-05T09:47:28.558870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:28.558870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wVhtXEsb9zeEyfF3FkQzzpFi+RD9bYGtPfj1jhCSHWY//lrbuckW/BrX5RXMdzFt9DVEuXiDR8EgjJm6bfSICA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:28.559396Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.16811","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00e1c5e1c6aae30c44d65c425b373214818c22980600197c3be81d08dc707c66","sha256:039cd6bf853a65375b8d798df7b9b1e42c4ee92075612407ac5c665389665415"],"state_sha256":"b5d2d0779da918f31372651db7b465db2828f931bbdfbbe9a216a5c408a365f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MT/ow1BNQE+v2ABQ28ptZSNq9Y/AI9YV6FpYqYCL3gmd/TFc2wQPbB7+EXFJxnb3nPP3gwtEEhUppycfP732Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:17:48.908828Z","bundle_sha256":"e8527a9f561cb42cb20baceb6690174c29d1b8ae00ad02f209ba8407b1f40dd0"}}