{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5EE4RYVXPQDTYWYIOYOVKK7PDR","short_pith_number":"pith:5EE4RYVX","schema_version":"1.0","canonical_sha256":"e909c8e2b77c073c5b08761d552bef1c7762b3c7f3a820244abfe67b02c3abaf","source":{"kind":"arxiv","id":"1904.12672","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.12672","created_at":"2026-05-17T23:43:27.662278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.12672v2","created_at":"2026-05-17T23:43:27.662278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12672","created_at":"2026-05-17T23:43:27.662278+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EE4RYVXPQDT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EE4RYVXPQDTYWYI","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EE4RYVX","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR","json":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR.json","graph_json":"https://pith.science/api/pith-number/5EE4RYVXPQDTYWYIOYOVKK7PDR/graph.json","events_json":"https://pith.science/api/pith-number/5EE4RYVXPQDTYWYIOYOVKK7PDR/events.json","paper":"https://pith.science/paper/5EE4RYVX"},"agent_actions":{"view_html":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR","download_json":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR.json","view_paper":"https://pith.science/paper/5EE4RYVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.12672&json=true","fetch_graph":"https://pith.science/api/pith-number/5EE4RYVXPQDTYWYIOYOVKK7PDR/graph.json","fetch_events":"https://pith.science/api/pith-number/5EE4RYVXPQDTYWYIOYOVKK7PDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/action/storage_attestation","attest_author":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/action/author_attestation","sign_citation":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/action/citation_signature","submit_replication":"https://pith.science/pith/5EE4RYVXPQDTYWYIOYOVKK7PDR/action/replication_record"}},"created_at":"2026-05-17T23:43:27.662278+00:00","updated_at":"2026-05-17T23:43:27.662278+00:00"}