{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OJI7N6DYN3M7SUIWJWHL6WHJD4","short_pith_number":"pith:OJI7N6DY","schema_version":"1.0","canonical_sha256":"7251f6f8786ed9f951164d8ebf58e91f05bf6af2dfea31cbbcbbea8e29ed9bb9","source":{"kind":"arxiv","id":"1408.7114","version":1},"attestation_state":"computed","paper":{"title":"Faster Computation of Expected Hypervolume Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Deutz, Iris Hupkens, Michael Emmerich","submitted_at":"2014-08-29T19:43:41Z","abstract_excerpt":"The expected improvement algorithm (or efficient global optimization) aims for global continuous optimization with a limited budget of black-box function evaluations. It is based on a statistical model of the function learned from previous evaluations and an infill criterion - the expected improvement - used to find a promising point for a new evaluation. The `expected improvement' infill criterion takes into account the mean and variance of a predictive multivariate Gaussian distribution.\n  The expected improvement algorithm has recently been generalized to multiobjective optimization. In ord"},"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":"1408.7114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-29T19:43:41Z","cross_cats_sorted":[],"title_canon_sha256":"c33a043d7756939433f089036d19f1fd6ab7d75b5480f6b1a9e283be791df634","abstract_canon_sha256":"4778958a28c04dba5b88ae965c33336f4270b0d5b57135a8277e26809c4e2d0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:59.620103Z","signature_b64":"ucmNuTRtvl7BDyJFPATyTfRq4tqvgopPigxLuyotapl5nE1Wkj8Fc2sW6mLCwUg/HRotW/E0vAc8A90+D2/6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7251f6f8786ed9f951164d8ebf58e91f05bf6af2dfea31cbbcbbea8e29ed9bb9","last_reissued_at":"2026-05-18T02:43:59.619705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:59.619705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Computation of Expected Hypervolume Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andr\\'e Deutz, Iris Hupkens, Michael Emmerich","submitted_at":"2014-08-29T19:43:41Z","abstract_excerpt":"The expected improvement algorithm (or efficient global optimization) aims for global continuous optimization with a limited budget of black-box function evaluations. It is based on a statistical model of the function learned from previous evaluations and an infill criterion - the expected improvement - used to find a promising point for a new evaluation. The `expected improvement' infill criterion takes into account the mean and variance of a predictive multivariate Gaussian distribution.\n  The expected improvement algorithm has recently been generalized to multiobjective optimization. In ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.7114","kind":"arxiv","version":1},"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":"1408.7114","created_at":"2026-05-18T02:43:59.619761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.7114v1","created_at":"2026-05-18T02:43:59.619761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.7114","created_at":"2026-05-18T02:43:59.619761+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJI7N6DYN3M7","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJI7N6DYN3M7SUIW","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJI7N6DY","created_at":"2026-05-18T12:28:41.024544+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/OJI7N6DYN3M7SUIWJWHL6WHJD4","json":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4.json","graph_json":"https://pith.science/api/pith-number/OJI7N6DYN3M7SUIWJWHL6WHJD4/graph.json","events_json":"https://pith.science/api/pith-number/OJI7N6DYN3M7SUIWJWHL6WHJD4/events.json","paper":"https://pith.science/paper/OJI7N6DY"},"agent_actions":{"view_html":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4","download_json":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4.json","view_paper":"https://pith.science/paper/OJI7N6DY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.7114&json=true","fetch_graph":"https://pith.science/api/pith-number/OJI7N6DYN3M7SUIWJWHL6WHJD4/graph.json","fetch_events":"https://pith.science/api/pith-number/OJI7N6DYN3M7SUIWJWHL6WHJD4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4/action/storage_attestation","attest_author":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4/action/author_attestation","sign_citation":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4/action/citation_signature","submit_replication":"https://pith.science/pith/OJI7N6DYN3M7SUIWJWHL6WHJD4/action/replication_record"}},"created_at":"2026-05-18T02:43:59.619761+00:00","updated_at":"2026-05-18T02:43:59.619761+00:00"}