{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:55IGERONLPJZKZPOC6ZDI6L5ZZ","short_pith_number":"pith:55IGERON","canonical_record":{"source":{"id":"2105.08195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"99ca6f8d868524fb878ec9464c8783bc77e0e36aefae07a37196b3f8912b802d","abstract_canon_sha256":"0e823edd383369d5b41e165cca926d1f026c129de8e78dfbc9d4c64e9d6e1fdd"},"schema_version":"1.0"},"canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","source":{"kind":"arxiv","id":"2105.08195","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08195","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08195v2","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08195","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"55IGERONLPJZ","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_16","alias_value":"55IGERONLPJZKZPO","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_8","alias_value":"55IGERON","created_at":"2026-07-05T03:26:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:55IGERONLPJZKZPOC6ZDI6L5ZZ","target":"record","payload":{"canonical_record":{"source":{"id":"2105.08195","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"99ca6f8d868524fb878ec9464c8783bc77e0e36aefae07a37196b3f8912b802d","abstract_canon_sha256":"0e823edd383369d5b41e165cca926d1f026c129de8e78dfbc9d4c64e9d6e1fdd"},"schema_version":"1.0"},"canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:16.979473Z","signature_b64":"XBl+/ESDgPxMc2DrX9ZYfyoy39yt2K/w9s8F+zP0ycoaWxtp+YHIaABRZVbeDO+v2bu6DRsRhJ5yvJnwYANDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","last_reissued_at":"2026-07-05T03:26:16.978938Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:16.978938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.08195","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-07-05T03:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8xXcALRkIcEbbCv1LAio9e5ZpiKJNoqYU+AUM4QmtbMuIG2q+Tz+LhyKbyA8KvltuYavvI7tR93AEg1aRezDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:39:10.611149Z"},"content_sha256":"8a350228fab399be02cb946099be10a956bd7c1b6349148050209458ee9bdf21","schema_version":"1.0","event_id":"sha256:8a350228fab399be02cb946099be10a956bd7c1b6349148050209458ee9bdf21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:55IGERONLPJZKZPOC6ZDI6L5ZZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eytan Bakshy, Maximilian Balandat, Samuel Daulton","submitted_at":"2021-05-17T23:31:42Z","abstract_excerpt":"Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying the optimal trade-offs between the objectives. However, many existing methods perform poorly when the observations are corrupted by noise. We propose a novel acquisition function, NEHVI, that overcomes this important practical limitation by applying a Bayesian treatment to the popular expected hypervolume improvement (EHVI) criterion and integrating over this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08195","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.08195/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"},"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-07-05T03:26:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBNz92fr9mu+TyXsdo2coROxEH2Z1YX/+5DycJXTdEWMW+eCKY392i2ex/R2e34NW+yktjTGwl3BUJgk9bQhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:39:10.611648Z"},"content_sha256":"26c6f139273685c9fd28722a2f6628b0ad69e9efccf6cb721bf592a521261283","schema_version":"1.0","event_id":"sha256:26c6f139273685c9fd28722a2f6628b0ad69e9efccf6cb721bf592a521261283"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/bundle.json","state_url":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/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-08-04T20:39:10Z","links":{"resolver":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ","bundle":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/bundle.json","state":"https://pith.science/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55IGERONLPJZKZPOC6ZDI6L5ZZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:55IGERONLPJZKZPOC6ZDI6L5ZZ","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":"0e823edd383369d5b41e165cca926d1f026c129de8e78dfbc9d4c64e9d6e1fdd","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","title_canon_sha256":"99ca6f8d868524fb878ec9464c8783bc77e0e36aefae07a37196b3f8912b802d"},"schema_version":"1.0","source":{"id":"2105.08195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.08195","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"arxiv_version","alias_value":"2105.08195v2","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08195","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_12","alias_value":"55IGERONLPJZ","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_16","alias_value":"55IGERONLPJZKZPO","created_at":"2026-07-05T03:26:16Z"},{"alias_kind":"pith_short_8","alias_value":"55IGERON","created_at":"2026-07-05T03:26:16Z"}],"graph_snapshots":[{"event_id":"sha256:26c6f139273685c9fd28722a2f6628b0ad69e9efccf6cb721bf592a521261283","target":"graph","created_at":"2026-07-05T03:26:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2105.08195/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing multiple competing black-box objectives is a challenging problem in many fields, including science, engineering, and machine learning. Multi-objective Bayesian optimization (MOBO) is a sample-efficient approach for identifying the optimal trade-offs between the objectives. However, many existing methods perform poorly when the observations are corrupted by noise. We propose a novel acquisition function, NEHVI, that overcomes this important practical limitation by applying a Bayesian treatment to the popular expected hypervolume improvement (EHVI) criterion and integrating over this ","authors_text":"Eytan Bakshy, Maximilian Balandat, Samuel Daulton","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","title":"Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08195","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:8a350228fab399be02cb946099be10a956bd7c1b6349148050209458ee9bdf21","target":"record","created_at":"2026-07-05T03:26:16Z","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":"0e823edd383369d5b41e165cca926d1f026c129de8e78dfbc9d4c64e9d6e1fdd","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-05-17T23:31:42Z","title_canon_sha256":"99ca6f8d868524fb878ec9464c8783bc77e0e36aefae07a37196b3f8912b802d"},"schema_version":"1.0","source":{"id":"2105.08195","kind":"arxiv","version":2}},"canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef506245cd5bd39565ee17b234797dce74fb9b56e0e4e0272c4365819884bcbf","first_computed_at":"2026-07-05T03:26:16.978938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:26:16.978938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XBl+/ESDgPxMc2DrX9ZYfyoy39yt2K/w9s8F+zP0ycoaWxtp+YHIaABRZVbeDO+v2bu6DRsRhJ5yvJnwYANDAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:26:16.979473Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.08195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a350228fab399be02cb946099be10a956bd7c1b6349148050209458ee9bdf21","sha256:26c6f139273685c9fd28722a2f6628b0ad69e9efccf6cb721bf592a521261283"],"state_sha256":"72484c88b88ba1c250c2dfd1bb2e04c7369fc8119c7ad3fe5e5b72ed8bdc9663"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rkRLijPhoemhOiv7Y5Kk13hyetKOuerwy6brN/FneaotcnGKm08xKFsELNHCp4LilWVwXpk+fIHvOS8chbdpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:39:10.616998Z","bundle_sha256":"7fbeb3468a5aecd309c50c6622ab9a81a194aa13f6c85fdc881bb88e976e1f52"}}