{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CSVQUC5NATT2PVFJWFNDM5G5Q6","short_pith_number":"pith:CSVQUC5N","canonical_record":{"source":{"id":"1712.00424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ec97f70f68a28a450479388db290fda4364b91108b4df5e81ebfc513129dd186","abstract_canon_sha256":"4c4fa2266c8b58e4521dd3697115908c9ba512a92d1e9c9cb572fb5a50dc706f"},"schema_version":"1.0"},"canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","source":{"kind":"arxiv","id":"1712.00424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00424","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00424v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00424","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"CSVQUC5NATT2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSVQUC5NATT2PVFJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSVQUC5N","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CSVQUC5NATT2PVFJWFNDM5G5Q6","target":"record","payload":{"canonical_record":{"source":{"id":"1712.00424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"ec97f70f68a28a450479388db290fda4364b91108b4df5e81ebfc513129dd186","abstract_canon_sha256":"4c4fa2266c8b58e4521dd3697115908c9ba512a92d1e9c9cb572fb5a50dc706f"},"schema_version":"1.0"},"canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:06.265037Z","signature_b64":"I0peDwoo0jZLp2HdXzndKpiIBFcsIch2BgCVMx9r4lTneEna5aWb7a66wn/IA6UCJCzZVE0gD/eyOAkDPaKCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","last_reissued_at":"2026-05-18T00:29:06.264552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:06.264552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.00424","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-18T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOHwX4aGl3Alqe+J5ciSQVqtE+zqqyYyjiP55CiL6GLLcP6LuG3Sam55mk3gah/yNhxld1dTNRggIQca3Y8tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:59:17.651461Z"},"content_sha256":"45712fdc4794c23e893aa388585b254baa00fc17e03c6a8f4d0874ba4734b86e","schema_version":"1.0","event_id":"sha256:45712fdc4794c23e893aa388585b254baa00fc17e03c6a8f4d0874ba4734b86e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CSVQUC5NATT2PVFJWFNDM5G5Q6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The reparameterization trick for acquisition functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth, Riccardo Moriconi","submitted_at":"2017-12-01T17:32:01Z","abstract_excerpt":"Bayesian optimization is a sample-efficient approach to solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, this ideal is difficult to achieve since optimizing acquisition functions per se is frequently non-trivial. This statement is especially true in the parallel setting, where acquisition functions are routinely non-convex, high-dimensional, and intractable. Here, we demonstrate how "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00424","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-18T00:29:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJ/rSa8C4HU6M9gYyBsM0QcS4pF8T/YftzeMcExjQLfAIBvzOy4/iWmzA19xd22x3NaQEfOqMwF8f6CYU6w9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:59:17.651810Z"},"content_sha256":"e937ee12818b6cfaa31b3bc7b6ad10ce4a9bb6cb5e41cbe9313a8a70f33e6caa","schema_version":"1.0","event_id":"sha256:e937ee12818b6cfaa31b3bc7b6ad10ce4a9bb6cb5e41cbe9313a8a70f33e6caa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/bundle.json","state_url":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/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-02T05:59:17Z","links":{"resolver":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6","bundle":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/bundle.json","state":"https://pith.science/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSVQUC5NATT2PVFJWFNDM5G5Q6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CSVQUC5NATT2PVFJWFNDM5G5Q6","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":"4c4fa2266c8b58e4521dd3697115908c9ba512a92d1e9c9cb572fb5a50dc706f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","title_canon_sha256":"ec97f70f68a28a450479388db290fda4364b91108b4df5e81ebfc513129dd186"},"schema_version":"1.0","source":{"id":"1712.00424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00424","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00424v1","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00424","created_at":"2026-05-18T00:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"CSVQUC5NATT2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSVQUC5NATT2PVFJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSVQUC5N","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:e937ee12818b6cfaa31b3bc7b6ad10ce4a9bb6cb5e41cbe9313a8a70f33e6caa","target":"graph","created_at":"2026-05-18T00:29:06Z","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 solving global optimization problems. Along with a surrogate model, this approach relies on theoretically motivated value heuristics (acquisition functions) to guide the search process. Maximizing acquisition functions yields the best performance; unfortunately, this ideal is difficult to achieve since optimizing acquisition functions per se is frequently non-trivial. This statement is especially true in the parallel setting, where acquisition functions are routinely non-convex, high-dimensional, and intractable. Here, we demonstrate how ","authors_text":"Frank Hutter, James T. Wilson, Marc Peter Deisenroth, Riccardo Moriconi","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","title":"The reparameterization trick for acquisition functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00424","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:45712fdc4794c23e893aa388585b254baa00fc17e03c6a8f4d0874ba4734b86e","target":"record","created_at":"2026-05-18T00:29:06Z","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":"4c4fa2266c8b58e4521dd3697115908c9ba512a92d1e9c9cb572fb5a50dc706f","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-12-01T17:32:01Z","title_canon_sha256":"ec97f70f68a28a450479388db290fda4364b91108b4df5e81ebfc513129dd186"},"schema_version":"1.0","source":{"id":"1712.00424","kind":"arxiv","version":1}},"canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14ab0a0bad04e7a7d4a9b15a3674dd87a519a1c4c0eecb84e5974059428f31ab","first_computed_at":"2026-05-18T00:29:06.264552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:06.264552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I0peDwoo0jZLp2HdXzndKpiIBFcsIch2BgCVMx9r4lTneEna5aWb7a66wn/IA6UCJCzZVE0gD/eyOAkDPaKCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:06.265037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45712fdc4794c23e893aa388585b254baa00fc17e03c6a8f4d0874ba4734b86e","sha256:e937ee12818b6cfaa31b3bc7b6ad10ce4a9bb6cb5e41cbe9313a8a70f33e6caa"],"state_sha256":"5595166d0622f160ea6bcb64948542ade5ad48925f9122b0bcd1b16e9feed919"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uk4aFjUVYLG8wSeSYScv1x+9VqrZwCHTTxiDcdZfwWePm7wLuPNI3AUsNQReHI6+21tcGJ62tBB4MAglTvGICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:59:17.653853Z","bundle_sha256":"16928a103405adaa3367bf299eb6f91aa3d99f36e989f03330ce0c02034fb30c"}}