{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:27MKCF3HJDUD362IFNH6ICX45A","short_pith_number":"pith:27MKCF3H","canonical_record":{"source":{"id":"1806.01159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T15:24:51Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"02a9ff4e7372965345d595efdca0a179f8b5dda7fa3ff4a4927ce6bce8af4cd5","abstract_canon_sha256":"c46ed8ec44e6470f987ed40cc76c508017ca5f2821bad60523226a5de5235691"},"schema_version":"1.0"},"canonical_sha256":"d7d8a1176748e83dfb482b4fe40afce81026619657099b6e36f40f14e03a5429","source":{"kind":"arxiv","id":"1806.01159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01159","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01159v2","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01159","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"27MKCF3HJDUD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27MKCF3HJDUD362I","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27MKCF3H","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:27MKCF3HJDUD362IFNH6ICX45A","target":"record","payload":{"canonical_record":{"source":{"id":"1806.01159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T15:24:51Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"02a9ff4e7372965345d595efdca0a179f8b5dda7fa3ff4a4927ce6bce8af4cd5","abstract_canon_sha256":"c46ed8ec44e6470f987ed40cc76c508017ca5f2821bad60523226a5de5235691"},"schema_version":"1.0"},"canonical_sha256":"d7d8a1176748e83dfb482b4fe40afce81026619657099b6e36f40f14e03a5429","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:21.588746Z","signature_b64":"wt0TljJJqGxcGLJwWWXwqXZL1bN1RyYYxwx0KRUi6Wkc761CEkbbwTvmlPkqb56J0wtXts4b+fFPwMb87PTKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7d8a1176748e83dfb482b4fe40afce81026619657099b6e36f40f14e03a5429","last_reissued_at":"2026-05-18T00:05:21.588276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:21.588276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.01159","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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PX/qjbwVRdwI2FR4CItcQXgLOHVVRkTO6k5em8tKQhQ1VdHXxge4sgdDrHYGTLju0JAKHEompnWFApeftmPJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:16:57.374231Z"},"content_sha256":"d2dad570ef35b70555ca9c8cc3bcc17e6b8ce8872f2a7a4c6d1464258535296f","schema_version":"1.0","event_id":"sha256:d2dad570ef35b70555ca9c8cc3bcc17e6b8ce8872f2a7a4c6d1464258535296f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:27MKCF3HJDUD362IFNH6ICX45A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient and Scalable Batch Bayesian Optimization Using K-Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Edward O. Pyzer-Knapp, Matthew Groves","submitted_at":"2018-06-04T15:24:51Z","abstract_excerpt":"We present K-Means Batch Bayesian Optimization (KMBBO), a novel batch sampling algorithm for Bayesian Optimization (BO). KMBBO uses unsupervised learning to efficiently estimate peaks of the model acquisition function. We show in empirical experiments that our method outperforms the current state-of-the-art batch allocation algorithms on a variety of test problems including tuning of algorithm hyper-parameters and a challenging drug discovery problem. In order to accommodate the real-world problem of high dimensional data, we propose a modification to KMBBO by combining it with compressed sens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01159","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:05:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tNGh04EpYJvDrlFPK3/ub6lvJzGpfUs4iMqIJomNVB465obzv2eDPPVlmgRT2qKS7OmXE8U6qgsStW347pwqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T10:16:57.374594Z"},"content_sha256":"a5a083d4bcef66d23e2d9001bbb253165c742367349378bd26351a0f94c6ce70","schema_version":"1.0","event_id":"sha256:a5a083d4bcef66d23e2d9001bbb253165c742367349378bd26351a0f94c6ce70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27MKCF3HJDUD362IFNH6ICX45A/bundle.json","state_url":"https://pith.science/pith/27MKCF3HJDUD362IFNH6ICX45A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27MKCF3HJDUD362IFNH6ICX45A/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-22T10:16:57Z","links":{"resolver":"https://pith.science/pith/27MKCF3HJDUD362IFNH6ICX45A","bundle":"https://pith.science/pith/27MKCF3HJDUD362IFNH6ICX45A/bundle.json","state":"https://pith.science/pith/27MKCF3HJDUD362IFNH6ICX45A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27MKCF3HJDUD362IFNH6ICX45A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:27MKCF3HJDUD362IFNH6ICX45A","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":"c46ed8ec44e6470f987ed40cc76c508017ca5f2821bad60523226a5de5235691","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T15:24:51Z","title_canon_sha256":"02a9ff4e7372965345d595efdca0a179f8b5dda7fa3ff4a4927ce6bce8af4cd5"},"schema_version":"1.0","source":{"id":"1806.01159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.01159","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"arxiv_version","alias_value":"1806.01159v2","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.01159","created_at":"2026-05-18T00:05:21Z"},{"alias_kind":"pith_short_12","alias_value":"27MKCF3HJDUD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"27MKCF3HJDUD362I","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"27MKCF3H","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a5a083d4bcef66d23e2d9001bbb253165c742367349378bd26351a0f94c6ce70","target":"graph","created_at":"2026-05-18T00:05:21Z","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":"We present K-Means Batch Bayesian Optimization (KMBBO), a novel batch sampling algorithm for Bayesian Optimization (BO). KMBBO uses unsupervised learning to efficiently estimate peaks of the model acquisition function. We show in empirical experiments that our method outperforms the current state-of-the-art batch allocation algorithms on a variety of test problems including tuning of algorithm hyper-parameters and a challenging drug discovery problem. In order to accommodate the real-world problem of high dimensional data, we propose a modification to KMBBO by combining it with compressed sens","authors_text":"Edward O. Pyzer-Knapp, Matthew Groves","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T15:24:51Z","title":"Efficient and Scalable Batch Bayesian Optimization Using K-Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.01159","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:d2dad570ef35b70555ca9c8cc3bcc17e6b8ce8872f2a7a4c6d1464258535296f","target":"record","created_at":"2026-05-18T00:05:21Z","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":"c46ed8ec44e6470f987ed40cc76c508017ca5f2821bad60523226a5de5235691","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-04T15:24:51Z","title_canon_sha256":"02a9ff4e7372965345d595efdca0a179f8b5dda7fa3ff4a4927ce6bce8af4cd5"},"schema_version":"1.0","source":{"id":"1806.01159","kind":"arxiv","version":2}},"canonical_sha256":"d7d8a1176748e83dfb482b4fe40afce81026619657099b6e36f40f14e03a5429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7d8a1176748e83dfb482b4fe40afce81026619657099b6e36f40f14e03a5429","first_computed_at":"2026-05-18T00:05:21.588276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:21.588276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wt0TljJJqGxcGLJwWWXwqXZL1bN1RyYYxwx0KRUi6Wkc761CEkbbwTvmlPkqb56J0wtXts4b+fFPwMb87PTKBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:21.588746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.01159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2dad570ef35b70555ca9c8cc3bcc17e6b8ce8872f2a7a4c6d1464258535296f","sha256:a5a083d4bcef66d23e2d9001bbb253165c742367349378bd26351a0f94c6ce70"],"state_sha256":"29272d353135fc2aa87778cb5a8c398aad2b6c8643854e8ce38fbe6769e3b5e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e175PVapdycqtODXiCrCNI7CfA5LvJ7uroedxoZlLEwUP7G2argf0sQzO0FE9oloNQp+iqc/zoZiwmLPjM71CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T10:16:57.376598Z","bundle_sha256":"363c527d1019f937b89e34749b7777f31166bee4d4add2ad3a8f7c3a68b33cc9"}}