{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GMMXMLPTALLYCH6IJFGQAV6MJO","short_pith_number":"pith:GMMXMLPT","schema_version":"1.0","canonical_sha256":"3319762df302d7811fc8494d0057cc4ba3073a09a094d07690c6051101d59264","source":{"kind":"arxiv","id":"2209.15367","version":1},"attestation_state":"computed","paper":{"title":"Efficient computation of the Knowledge Gradient for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Juan Ungredda, Juergen Branke, Michael Pearce","submitted_at":"2022-09-30T10:39:38Z","abstract_excerpt":"Bayesian optimization is a powerful collection of methods for optimizing stochastic expensive black box functions. One key component of a Bayesian optimization algorithm is the acquisition function that determines which solution should be evaluated in every iteration. A popular and very effective choice is the Knowledge Gradient acquisition function, however there is no analytical way to compute it. Several different implementations make different approximations. In this paper, we review and compare the spectrum of Knowledge Gradient implementations and propose One-shot Hybrid KG, a new approa"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2209.15367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-09-30T10:39:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a843dab4d6b917795bd7aeda10107fcef39a4e1dd4f86c5ddb2d330e21c6f2f7","abstract_canon_sha256":"2e475095d1cc5381600698fff75913ef00305a944eaee28d7ae0e2f7ca3bec83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:19.297990Z","signature_b64":"DZf9GvaO+K9h/URXQLZF1pgggeyVmPJyRVM8hD/F6kyGTfl1XmfGZEgCYOwhDqCNKs83INBVDeN+FDJxb2hyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3319762df302d7811fc8494d0057cc4ba3073a09a094d07690c6051101d59264","last_reissued_at":"2026-07-05T05:02:19.297651Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:19.297651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computation of the Knowledge Gradient for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Juan Ungredda, Juergen Branke, Michael Pearce","submitted_at":"2022-09-30T10:39:38Z","abstract_excerpt":"Bayesian optimization is a powerful collection of methods for optimizing stochastic expensive black box functions. One key component of a Bayesian optimization algorithm is the acquisition function that determines which solution should be evaluated in every iteration. A popular and very effective choice is the Knowledge Gradient acquisition function, however there is no analytical way to compute it. Several different implementations make different approximations. In this paper, we review and compare the spectrum of Knowledge Gradient implementations and propose One-shot Hybrid KG, a new approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.15367","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.15367/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2209.15367","created_at":"2026-07-05T05:02:19.297706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.15367v1","created_at":"2026-07-05T05:02:19.297706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.15367","created_at":"2026-07-05T05:02:19.297706+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMMXMLPTALLY","created_at":"2026-07-05T05:02:19.297706+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMMXMLPTALLYCH6I","created_at":"2026-07-05T05:02:19.297706+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMMXMLPT","created_at":"2026-07-05T05:02:19.297706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11456","citing_title":"Fast Bayesian Optimization of Function Networks with Partial Evaluations","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO","json":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO.json","graph_json":"https://pith.science/api/pith-number/GMMXMLPTALLYCH6IJFGQAV6MJO/graph.json","events_json":"https://pith.science/api/pith-number/GMMXMLPTALLYCH6IJFGQAV6MJO/events.json","paper":"https://pith.science/paper/GMMXMLPT"},"agent_actions":{"view_html":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO","download_json":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO.json","view_paper":"https://pith.science/paper/GMMXMLPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.15367&json=true","fetch_graph":"https://pith.science/api/pith-number/GMMXMLPTALLYCH6IJFGQAV6MJO/graph.json","fetch_events":"https://pith.science/api/pith-number/GMMXMLPTALLYCH6IJFGQAV6MJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO/action/storage_attestation","attest_author":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO/action/author_attestation","sign_citation":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO/action/citation_signature","submit_replication":"https://pith.science/pith/GMMXMLPTALLYCH6IJFGQAV6MJO/action/replication_record"}},"created_at":"2026-07-05T05:02:19.297706+00:00","updated_at":"2026-07-05T05:02:19.297706+00:00"}