{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5EE4RYVXPQDTYWYIOYOVKK7PDR","short_pith_number":"pith:5EE4RYVX","canonical_record":{"source":{"id":"1904.12672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T11:23:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47d26e14ca07f1f5a697fb39be40054a6aaf4a6a494fa6250fca74698f9551db","abstract_canon_sha256":"dd22688553f75944259124afdb09560856ecbb55ba270cc3b6f2946e70244bdf"},"schema_version":"1.0"},"canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","source":{"kind":"arxiv","id":"1904.12672","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12672","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12672v2","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12672","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"5EE4RYVXPQDT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5EE4RYVXPQDTYWYI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5EE4RYVX","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5EE4RYVXPQDTYWYIOYOVKK7PDR","target":"record","payload":{"canonical_record":{"source":{"id":"1904.12672","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T11:23:26Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47d26e14ca07f1f5a697fb39be40054a6aaf4a6a494fa6250fca74698f9551db","abstract_canon_sha256":"dd22688553f75944259124afdb09560856ecbb55ba270cc3b6f2946e70244bdf"},"schema_version":"1.0"},"canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:27.662647Z","signature_b64":"Fp1brtDubr8WO30AoJG7g4ib9b0y5mF0jfPHf2Z6h7+1m/WrsnAFrulD3bLjuc7QUuxxMqGHh/lh7G2CVxpDCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","last_reissued_at":"2026-05-17T23:43:27.662214Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:27.662214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.12672","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-17T23:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4l5UC7ZmHZwXBJbVVoTLGx5EVqyWiB5y3AVYmceTxHz8Wc06JRCh+PPA5meiq0dJnc3Kb6ywJvX0vO24xnGqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:28:50.403960Z"},"content_sha256":"fee2de5d4a18475525d4a710f595bdab2119191f7e8397e379561bd191c45afe","schema_version":"1.0","event_id":"sha256:fee2de5d4a18475525d4a710f595bdab2119191f7e8397e379561bd191c45afe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5EE4RYVXPQDTYWYIOYOVKK7PDR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of Expected Hypervolume Improvement Using Box Decomposition Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andr\\'e Deutz, Kaifeng Yang, Michael Emmerich, Thomas B\\\"ack","submitted_at":"2019-04-26T11:23:26Z","abstract_excerpt":"In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian Process models learned from previous objective function evaluations to decide the next evaluation site by maximizing or minimizing an infill criterion. A common criterion in MOBGO is the Expected Hypervolume Improvement (EHVI), which shows a good performance on a wide range of problems, with respect to exploration and exploitation. However, so far it has been a c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12672","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-17T23:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tEXI1D0TWHKq40JZRb0wXiZhSds3qO+3VyDBmWL6/jM522TxBQOUXiUjX/Jlz+Bg05CCj5l2vhdyFNOb9zleBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:28:50.404687Z"},"content_sha256":"8749ee81ce188bde2753ee06a3063c35b53a24b7ccd62d3947e7d1dcf6083254","schema_version":"1.0","event_id":"sha256:8749ee81ce188bde2753ee06a3063c35b53a24b7ccd62d3947e7d1dcf6083254"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/bundle.json","state_url":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/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-22T04:28:50Z","links":{"resolver":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR","bundle":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/bundle.json","state":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5EE4RYVXPQDTYWYIOYOVKK7PDR","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":"dd22688553f75944259124afdb09560856ecbb55ba270cc3b6f2946e70244bdf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T11:23:26Z","title_canon_sha256":"47d26e14ca07f1f5a697fb39be40054a6aaf4a6a494fa6250fca74698f9551db"},"schema_version":"1.0","source":{"id":"1904.12672","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12672","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12672v2","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12672","created_at":"2026-05-17T23:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"5EE4RYVXPQDT","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5EE4RYVXPQDTYWYI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5EE4RYVX","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:8749ee81ce188bde2753ee06a3063c35b53a24b7ccd62d3947e7d1dcf6083254","target":"graph","created_at":"2026-05-17T23:43:27Z","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 the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian Process models learned from previous objective function evaluations to decide the next evaluation site by maximizing or minimizing an infill criterion. A common criterion in MOBGO is the Expected Hypervolume Improvement (EHVI), which shows a good performance on a wide range of problems, with respect to exploration and exploitation. However, so far it has been a c","authors_text":"Andr\\'e Deutz, Kaifeng Yang, Michael Emmerich, Thomas B\\\"ack","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T11:23:26Z","title":"Efficient Computation of Expected Hypervolume Improvement Using Box Decomposition Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12672","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:fee2de5d4a18475525d4a710f595bdab2119191f7e8397e379561bd191c45afe","target":"record","created_at":"2026-05-17T23:43:27Z","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":"dd22688553f75944259124afdb09560856ecbb55ba270cc3b6f2946e70244bdf","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-26T11:23:26Z","title_canon_sha256":"47d26e14ca07f1f5a697fb39be40054a6aaf4a6a494fa6250fca74698f9551db"},"schema_version":"1.0","source":{"id":"1904.12672","kind":"arxiv","version":2}},"canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","first_computed_at":"2026-05-17T23:43:27.662214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:27.662214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fp1brtDubr8WO30AoJG7g4ib9b0y5mF0jfPHf2Z6h7+1m/WrsnAFrulD3bLjuc7QUuxxMqGHh/lh7G2CVxpDCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:27.662647Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12672","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fee2de5d4a18475525d4a710f595bdab2119191f7e8397e379561bd191c45afe","sha256:8749ee81ce188bde2753ee06a3063c35b53a24b7ccd62d3947e7d1dcf6083254"],"state_sha256":"b622ae2d5a63489026aeddfc5f580e1904efc7a7822a59e21abb7afd29b2e4b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WTHMLJBJqxyDr/y2F4nXwilhepIutMbfYWhimR3lZ8vBzrNr3YCPudPQwMVzEogR5pZ06qLkPurWciUZprADA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:28:50.408704Z","bundle_sha256":"7569ccfd1e6e4dd05462d385a2389c170ee39ef53cfd23f37c472f31d6972afb"}}