{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CS5FL7DUFCA266OKMYE3DXZDMZ","short_pith_number":"pith:CS5FL7DU","canonical_record":{"source":{"id":"1606.04414","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-14T15:12:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cbf357a10245f3c4d371f44289238d88bdff41ab25a2b08e1f881a2c5162928d","abstract_canon_sha256":"f4a40bac5e19d5bcee56566679ef9de2c84254be8983c4373940e2d07abbaa07"},"schema_version":"1.0"},"canonical_sha256":"14ba55fc742881af79ca6609b1df23667e6b62792b0f9b217d554f74d84436a8","source":{"kind":"arxiv","id":"1606.04414","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04414","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04414v4","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04414","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"CS5FL7DUFCA2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CS5FL7DUFCA266OK","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CS5FL7DU","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CS5FL7DUFCA266OKMYE3DXZDMZ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04414","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-14T15:12:01Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cbf357a10245f3c4d371f44289238d88bdff41ab25a2b08e1f881a2c5162928d","abstract_canon_sha256":"f4a40bac5e19d5bcee56566679ef9de2c84254be8983c4373940e2d07abbaa07"},"schema_version":"1.0"},"canonical_sha256":"14ba55fc742881af79ca6609b1df23667e6b62792b0f9b217d554f74d84436a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.313243Z","signature_b64":"lSGR6izPMJYP4v64qANXnyMbjKkw/UIaM4Yek39Gq4IUCpY0Ner+Q5i3L6NQYFQtq4mRhYlLgiGtxSLn0yFjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ba55fc742881af79ca6609b1df23667e6b62792b0f9b217d554f74d84436a8","last_reissued_at":"2026-05-18T00:17:55.312534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.312534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04414","source_version":4,"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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2fzvJScbC3td+rqPaWUF0F1Ssp092G+9L0Cn+hd+L8UfOxoby5wtyVimkkRoKS2/5M8PrGVJyjZWF82ia1F1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:10:22.815972Z"},"content_sha256":"eb5c860f62dfe93e6a85291b346a89aa4fffd9526db3a6ce79d1be04737f8fe4","schema_version":"1.0","event_id":"sha256:eb5c860f62dfe93e6a85291b346a89aa4fffd9526db3a6ce79d1be04737f8fe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CS5FL7DUFCA266OKMYE3DXZDMZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parallel Knowledge Gradient Method for Batch Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Jian Wu, Peter I. Frazier","submitted_at":"2016-06-14T15:12:01Z","abstract_excerpt":"In many applications of black-box optimization, one can evaluate multiple points simultaneously, e.g. when evaluating the performances of several different neural network architectures in a parallel computing environment. In this paper, we develop a novel batch Bayesian optimization algorithm --- the parallel knowledge gradient method. By construction, this method provides the one-step Bayes-optimal batch of points to sample. We provide an efficient strategy for computing this Bayes-optimal batch of points, and we demonstrate that the parallel knowledge gradient method finds global optima sign"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04414","kind":"arxiv","version":4},"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:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5x/m82oBJfv9SHeimOQJ9c6nbEPXRtvdz4ThT9M20+cZ+wA3weCqXeqNIBVZhDpspupDSscrFYhLAGVd0iNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:10:22.816626Z"},"content_sha256":"2273b833c26ff6f3d74c226f1c78c26da7373bb7299a37740905a300524bc881","schema_version":"1.0","event_id":"sha256:2273b833c26ff6f3d74c226f1c78c26da7373bb7299a37740905a300524bc881"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/bundle.json","state_url":"https://pith.science/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/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-25T17:10:22Z","links":{"resolver":"https://pith.science/pith/CS5FL7DUFCA266OKMYE3DXZDMZ","bundle":"https://pith.science/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/bundle.json","state":"https://pith.science/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CS5FL7DUFCA266OKMYE3DXZDMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CS5FL7DUFCA266OKMYE3DXZDMZ","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":"f4a40bac5e19d5bcee56566679ef9de2c84254be8983c4373940e2d07abbaa07","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-14T15:12:01Z","title_canon_sha256":"cbf357a10245f3c4d371f44289238d88bdff41ab25a2b08e1f881a2c5162928d"},"schema_version":"1.0","source":{"id":"1606.04414","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04414","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04414v4","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04414","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"CS5FL7DUFCA2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CS5FL7DUFCA266OK","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CS5FL7DU","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:2273b833c26ff6f3d74c226f1c78c26da7373bb7299a37740905a300524bc881","target":"graph","created_at":"2026-05-18T00:17:55Z","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":"In many applications of black-box optimization, one can evaluate multiple points simultaneously, e.g. when evaluating the performances of several different neural network architectures in a parallel computing environment. In this paper, we develop a novel batch Bayesian optimization algorithm --- the parallel knowledge gradient method. By construction, this method provides the one-step Bayes-optimal batch of points to sample. We provide an efficient strategy for computing this Bayes-optimal batch of points, and we demonstrate that the parallel knowledge gradient method finds global optima sign","authors_text":"Jian Wu, Peter I. Frazier","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-14T15:12:01Z","title":"The Parallel Knowledge Gradient Method for Batch Bayesian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04414","kind":"arxiv","version":4},"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:eb5c860f62dfe93e6a85291b346a89aa4fffd9526db3a6ce79d1be04737f8fe4","target":"record","created_at":"2026-05-18T00:17:55Z","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":"f4a40bac5e19d5bcee56566679ef9de2c84254be8983c4373940e2d07abbaa07","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-14T15:12:01Z","title_canon_sha256":"cbf357a10245f3c4d371f44289238d88bdff41ab25a2b08e1f881a2c5162928d"},"schema_version":"1.0","source":{"id":"1606.04414","kind":"arxiv","version":4}},"canonical_sha256":"14ba55fc742881af79ca6609b1df23667e6b62792b0f9b217d554f74d84436a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14ba55fc742881af79ca6609b1df23667e6b62792b0f9b217d554f74d84436a8","first_computed_at":"2026-05-18T00:17:55.312534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.312534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lSGR6izPMJYP4v64qANXnyMbjKkw/UIaM4Yek39Gq4IUCpY0Ner+Q5i3L6NQYFQtq4mRhYlLgiGtxSLn0yFjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.313243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04414","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb5c860f62dfe93e6a85291b346a89aa4fffd9526db3a6ce79d1be04737f8fe4","sha256:2273b833c26ff6f3d74c226f1c78c26da7373bb7299a37740905a300524bc881"],"state_sha256":"3b1097210801b87f309ab930325f75c5f63ba589692ac90a27e11b918b2e5a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNgiM1oezVi6uKDzOKJDaOQzlb03T2VrGxAql9gPaTjNdR8EvAKzuHvOOBvXuajKg9k99oMg/lr7Rw4ZlVBdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:10:22.820466Z","bundle_sha256":"5aa3f426b35be560679947c41c73e7e30bfccac3425e204608803bdc6d168e01"}}