{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SOPM5BTIYWHVTXHWQ43WCCZFWG","short_pith_number":"pith:SOPM5BTI","canonical_record":{"source":{"id":"1805.10196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T15:28:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e7b889b6972ca4afcf86863c8518aa2dddb6f96c913af8dea316afe7a0e20931","abstract_canon_sha256":"b180b02dd7e770a17042133922aa6878ff4fb71185a6b55ba7faee6a76ddfd14"},"schema_version":"1.0"},"canonical_sha256":"939ece8668c58f59dcf68737610b25b1ad9f799dae30cccaf73a78e9a0e94c92","source":{"kind":"arxiv","id":"1805.10196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10196","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10196v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10196","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"SOPM5BTIYWHV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SOPM5BTIYWHVTXHW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SOPM5BTI","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SOPM5BTIYWHVTXHWQ43WCCZFWG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T15:28:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e7b889b6972ca4afcf86863c8518aa2dddb6f96c913af8dea316afe7a0e20931","abstract_canon_sha256":"b180b02dd7e770a17042133922aa6878ff4fb71185a6b55ba7faee6a76ddfd14"},"schema_version":"1.0"},"canonical_sha256":"939ece8668c58f59dcf68737610b25b1ad9f799dae30cccaf73a78e9a0e94c92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.662281Z","signature_b64":"FI2habBXtZV8dHIk+b7Q0/YqdCk4U7esOpcTKGX+r3e8fVj7GH/xdTXEO91uWt8F2cg5yxjCUPmgOQGw7Wt7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"939ece8668c58f59dcf68737610b25b1ad9f799dae30cccaf73a78e9a0e94c92","last_reissued_at":"2026-05-17T23:59:22.661905Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.661905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10196","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-05-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wmmvR2XJ7DwWdER8plHRMKDsDWpfI9K2NbR/0yPod8OcCcfsYuQvNV0UP7QaBA+TXqNUTDHTF1GMYQ5UgXH8BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:53:56.699618Z"},"content_sha256":"deb57922915feafd3988ebc6c69ef935dadc93beb49b397e432c60bcd4c27996","schema_version":"1.0","event_id":"sha256:deb57922915feafd3988ebc6c69ef935dadc93beb49b397e432c60bcd4c27996"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SOPM5BTIYWHVTXHWQ43WCCZFWG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing acquisition functions for Bayesian optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth","submitted_at":"2018-05-25T15:28:46Z","abstract_excerpt":"Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions are frequently non-trivial to optimize. This statement is especially true when evaluating queries in parallel, where acquisition functions are routinely non-convex, high-dimensional, and intractable. We first show that acquisition functions estimated via Monte Carlo integration a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10196","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":""},"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMjqaHyP7PNkz91iV5Hbmybfrnc1jXBXN5JEJxM8Cs9bIgRRDDCIwzPpth32aWJGZbaLjw5VkF0mRMtwPhDQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:53:56.699968Z"},"content_sha256":"e70b9285874f6dc1b23960db5c318b1eabad10355e9900c4d05ad9412618fb5d","schema_version":"1.0","event_id":"sha256:e70b9285874f6dc1b23960db5c318b1eabad10355e9900c4d05ad9412618fb5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/bundle.json","state_url":"https://pith.science/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/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-05-22T01:53:56Z","links":{"resolver":"https://pith.science/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG","bundle":"https://pith.science/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/bundle.json","state":"https://pith.science/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOPM5BTIYWHVTXHWQ43WCCZFWG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SOPM5BTIYWHVTXHWQ43WCCZFWG","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":"b180b02dd7e770a17042133922aa6878ff4fb71185a6b55ba7faee6a76ddfd14","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T15:28:46Z","title_canon_sha256":"e7b889b6972ca4afcf86863c8518aa2dddb6f96c913af8dea316afe7a0e20931"},"schema_version":"1.0","source":{"id":"1805.10196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10196","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10196v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10196","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"SOPM5BTIYWHV","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SOPM5BTIYWHVTXHW","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SOPM5BTI","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:e70b9285874f6dc1b23960db5c318b1eabad10355e9900c4d05ad9412618fb5d","target":"graph","created_at":"2026-05-17T23:59:22Z","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":"Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions are frequently non-trivial to optimize. This statement is especially true when evaluating queries in parallel, where acquisition functions are routinely non-convex, high-dimensional, and intractable. We first show that acquisition functions estimated via Monte Carlo integration a","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T15:28:46Z","title":"Maximizing acquisition functions for Bayesian optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10196","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:deb57922915feafd3988ebc6c69ef935dadc93beb49b397e432c60bcd4c27996","target":"record","created_at":"2026-05-17T23:59:22Z","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":"b180b02dd7e770a17042133922aa6878ff4fb71185a6b55ba7faee6a76ddfd14","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-25T15:28:46Z","title_canon_sha256":"e7b889b6972ca4afcf86863c8518aa2dddb6f96c913af8dea316afe7a0e20931"},"schema_version":"1.0","source":{"id":"1805.10196","kind":"arxiv","version":2}},"canonical_sha256":"939ece8668c58f59dcf68737610b25b1ad9f799dae30cccaf73a78e9a0e94c92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"939ece8668c58f59dcf68737610b25b1ad9f799dae30cccaf73a78e9a0e94c92","first_computed_at":"2026-05-17T23:59:22.661905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:22.661905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FI2habBXtZV8dHIk+b7Q0/YqdCk4U7esOpcTKGX+r3e8fVj7GH/xdTXEO91uWt8F2cg5yxjCUPmgOQGw7Wt7BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:22.662281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:deb57922915feafd3988ebc6c69ef935dadc93beb49b397e432c60bcd4c27996","sha256:e70b9285874f6dc1b23960db5c318b1eabad10355e9900c4d05ad9412618fb5d"],"state_sha256":"dcd9a3750fd51a7597f1f427ac175e35caac1d41f79cfbaec2de2a2cd132fa94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulepD+z7a7rv//uvTcMsfmfphJRUj131SwRPVN07Lh3e2L9QTK+Sz1lmS4Rq0D+iNw1jYfXNLYQ5fSFemwK/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:53:56.702334Z","bundle_sha256":"1eccbaa7847f8dd6afdf3f00de56ccbd33f46efb77aa6c1e749ec731e03b9d03"}}