{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QX27JBXUHGEYXBWVWPSXJOLFYZ","short_pith_number":"pith:QX27JBXU","canonical_record":{"source":{"id":"1707.06541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-20T14:28:05Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC","math.PR"],"title_canon_sha256":"d59f6fbaea92d9906072b9db74babe1818a49cb63af8a13e9cecc4d5d500c0f0","abstract_canon_sha256":"8fa23f8cad2084ed616ab2aecd9e9be71cf0d0d13662bb02c5ed6df93fac401e"},"schema_version":"1.0"},"canonical_sha256":"85f5f486f439898b86d5b3e574b965c669002f928bb77c3b82d09780d061a9e6","source":{"kind":"arxiv","id":"1707.06541","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06541","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06541v2","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06541","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"QX27JBXUHGEY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QX27JBXUHGEYXBWV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QX27JBXU","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QX27JBXUHGEYXBWVWPSXJOLFYZ","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-20T14:28:05Z","cross_cats_sorted":["cs.AI","cs.LG","math.OC","math.PR"],"title_canon_sha256":"d59f6fbaea92d9906072b9db74babe1818a49cb63af8a13e9cecc4d5d500c0f0","abstract_canon_sha256":"8fa23f8cad2084ed616ab2aecd9e9be71cf0d0d13662bb02c5ed6df93fac401e"},"schema_version":"1.0"},"canonical_sha256":"85f5f486f439898b86d5b3e574b965c669002f928bb77c3b82d09780d061a9e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:23.697942Z","signature_b64":"+oVq5BHkllyzqWHysA3BGRCtnTrXeEsx+IqDYM7tqtK3YQdfuJdcWU4e/+bwhMXVNBPQaJHuYIRfrwKZ5NJCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f5f486f439898b86d5b3e574b965c669002f928bb77c3b82d09780d061a9e6","last_reissued_at":"2026-05-18T00:39:23.697195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:23.697195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06541","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-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M35jY4pMV2U/tTODznfTO/l3txkSVhITsR2Zl4ftsZH1JizCw32SL6EdyhCr4RGiTruOkRABYASgR2zA/AoBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:44:54.013150Z"},"content_sha256":"50a1c1e0320c297c669f0fa27c1c2117d37b77081fca17b2096dd8d19f52743b","schema_version":"1.0","event_id":"sha256:50a1c1e0320c297c669f0fa27c1c2117d37b77081fca17b2096dd8d19f52743b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QX27JBXUHGEYXBWVWPSXJOLFYZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discretization-free Knowledge Gradient Methods for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.OC","math.PR"],"primary_cat":"stat.ML","authors_text":"Jian Wu, Peter I. Frazier","submitted_at":"2017-07-20T14:28:05Z","abstract_excerpt":"This paper studies Bayesian ranking and selection (R&S) problems with correlated prior beliefs and continuous domains, i.e. Bayesian optimization (BO). Knowledge gradient methods [Frazier et al., 2008, 2009] have been widely studied for discrete R&S problems, which sample the one-step Bayes-optimal point. When used over continuous domains, previous work on the knowledge gradient [Scott et al., 2011, Wu and Frazier, 2016, Wu et al., 2017] often rely on a discretized finite approximation. However, the discretization introduces error and scales poorly as the dimension of domain grows. In this pap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06541","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-18T00:39:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWicXFI9XuTLJGNvpH++9lWzeVjulGhN6ddlDVzfRUQWPs2wRUWm68jR/LWHlbu190AnNO85D2vu6JocehRpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:44:54.013862Z"},"content_sha256":"38e0cfe138ca11ad5ea34c10d72ffe72a25ef471cafb71a2523dea4e32625f19","schema_version":"1.0","event_id":"sha256:38e0cfe138ca11ad5ea34c10d72ffe72a25ef471cafb71a2523dea4e32625f19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/bundle.json","state_url":"https://pith.science/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/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-26T01:44:54Z","links":{"resolver":"https://pith.science/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ","bundle":"https://pith.science/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/bundle.json","state":"https://pith.science/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QX27JBXUHGEYXBWVWPSXJOLFYZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QX27JBXUHGEYXBWVWPSXJOLFYZ","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":"8fa23f8cad2084ed616ab2aecd9e9be71cf0d0d13662bb02c5ed6df93fac401e","cross_cats_sorted":["cs.AI","cs.LG","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-20T14:28:05Z","title_canon_sha256":"d59f6fbaea92d9906072b9db74babe1818a49cb63af8a13e9cecc4d5d500c0f0"},"schema_version":"1.0","source":{"id":"1707.06541","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06541","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06541v2","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06541","created_at":"2026-05-18T00:39:23Z"},{"alias_kind":"pith_short_12","alias_value":"QX27JBXUHGEY","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QX27JBXUHGEYXBWV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QX27JBXU","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:38e0cfe138ca11ad5ea34c10d72ffe72a25ef471cafb71a2523dea4e32625f19","target":"graph","created_at":"2026-05-18T00:39:23Z","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":"This paper studies Bayesian ranking and selection (R&S) problems with correlated prior beliefs and continuous domains, i.e. Bayesian optimization (BO). Knowledge gradient methods [Frazier et al., 2008, 2009] have been widely studied for discrete R&S problems, which sample the one-step Bayes-optimal point. When used over continuous domains, previous work on the knowledge gradient [Scott et al., 2011, Wu and Frazier, 2016, Wu et al., 2017] often rely on a discretized finite approximation. However, the discretization introduces error and scales poorly as the dimension of domain grows. In this pap","authors_text":"Jian Wu, Peter I. Frazier","cross_cats":["cs.AI","cs.LG","math.OC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-20T14:28:05Z","title":"Discretization-free Knowledge Gradient Methods for Bayesian Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06541","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:50a1c1e0320c297c669f0fa27c1c2117d37b77081fca17b2096dd8d19f52743b","target":"record","created_at":"2026-05-18T00:39:23Z","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":"8fa23f8cad2084ed616ab2aecd9e9be71cf0d0d13662bb02c5ed6df93fac401e","cross_cats_sorted":["cs.AI","cs.LG","math.OC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-20T14:28:05Z","title_canon_sha256":"d59f6fbaea92d9906072b9db74babe1818a49cb63af8a13e9cecc4d5d500c0f0"},"schema_version":"1.0","source":{"id":"1707.06541","kind":"arxiv","version":2}},"canonical_sha256":"85f5f486f439898b86d5b3e574b965c669002f928bb77c3b82d09780d061a9e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85f5f486f439898b86d5b3e574b965c669002f928bb77c3b82d09780d061a9e6","first_computed_at":"2026-05-18T00:39:23.697195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:23.697195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+oVq5BHkllyzqWHysA3BGRCtnTrXeEsx+IqDYM7tqtK3YQdfuJdcWU4e/+bwhMXVNBPQaJHuYIRfrwKZ5NJCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:23.697942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06541","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50a1c1e0320c297c669f0fa27c1c2117d37b77081fca17b2096dd8d19f52743b","sha256:38e0cfe138ca11ad5ea34c10d72ffe72a25ef471cafb71a2523dea4e32625f19"],"state_sha256":"71b239008449a9d0306ed4a51d94c0b7d0d892a4d3a221b5708ae83ddd70e32d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnHcuYyhcywJeKCaZrV14eh9bm6PnJmFYRitGqghAZZgmRvZNE3xd74jU/vhu7E+SIULUxa+MeE1qgDGanmxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:44:54.017386Z","bundle_sha256":"983dd8c09d32197a7e144f0b302fe2aad4f8e945d7562e3435a1a16d1d4cce2d"}}