{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BJWNRWVSGEFOTT3WWSC4YQHOJY","short_pith_number":"pith:BJWNRWVS","schema_version":"1.0","canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","source":{"kind":"arxiv","id":"1903.02167","version":1},"attestation_state":"computed","paper":{"title":"Efficient Multi-Objective Optimization through Population-based Parallel Surrogate Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Christine A. Shoemaker, Taimoor Akhtar","submitted_at":"2019-03-06T04:13:28Z","abstract_excerpt":"Multi-Objective Optimization (MOO) is very difficult for expensive functions because most current MOO methods rely on a large number of function evaluations to get an accurate solution. We address this problem with surrogate approximation and parallel computation. We develop an MOO algorithm MOPLS-N for expensive functions that combines iteratively updated surrogate approximations of the objective functions with a structure for efficiently selecting a population of $N$ points so that the expensive objectives for all points are simultaneously evaluated on $N$ processors in each iteration. MOPLS"},"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":"1903.02167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-06T04:13:28Z","cross_cats_sorted":[],"title_canon_sha256":"0df0b537752aec6dfcf81a5cd094b25b72fec7a1ca17be11d669783a8cc3d50a","abstract_canon_sha256":"e5447623a5a0f404ad2fca89a409cde127c62d5484fc1513e74416b94ded531b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.585421Z","signature_b64":"TnlNNe/2Xckt8XMZG0qpPystzv8uSrLtU5MKtDK9H6LekrSYVmAKSkA0LMizvG8sPH/zbLp5T7UO01QE5X+jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","last_reissued_at":"2026-05-17T23:51:56.584914Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.584914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Multi-Objective Optimization through Population-based Parallel Surrogate Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Christine A. Shoemaker, Taimoor Akhtar","submitted_at":"2019-03-06T04:13:28Z","abstract_excerpt":"Multi-Objective Optimization (MOO) is very difficult for expensive functions because most current MOO methods rely on a large number of function evaluations to get an accurate solution. We address this problem with surrogate approximation and parallel computation. We develop an MOO algorithm MOPLS-N for expensive functions that combines iteratively updated surrogate approximations of the objective functions with a structure for efficiently selecting a population of $N$ points so that the expensive objectives for all points are simultaneously evaluated on $N$ processors in each iteration. MOPLS"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02167","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":"1903.02167","created_at":"2026-05-17T23:51:56.584989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02167v1","created_at":"2026-05-17T23:51:56.584989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02167","created_at":"2026-05-17T23:51:56.584989+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJWNRWVSGEFO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJWNRWVSGEFOTT3W","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJWNRWVS","created_at":"2026-05-18T12:33:12.712433+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/BJWNRWVSGEFOTT3WWSC4YQHOJY","json":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY.json","graph_json":"https://pith.science/api/pith-number/BJWNRWVSGEFOTT3WWSC4YQHOJY/graph.json","events_json":"https://pith.science/api/pith-number/BJWNRWVSGEFOTT3WWSC4YQHOJY/events.json","paper":"https://pith.science/paper/BJWNRWVS"},"agent_actions":{"view_html":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY","download_json":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY.json","view_paper":"https://pith.science/paper/BJWNRWVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02167&json=true","fetch_graph":"https://pith.science/api/pith-number/BJWNRWVSGEFOTT3WWSC4YQHOJY/graph.json","fetch_events":"https://pith.science/api/pith-number/BJWNRWVSGEFOTT3WWSC4YQHOJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/action/storage_attestation","attest_author":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/action/author_attestation","sign_citation":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/action/citation_signature","submit_replication":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/action/replication_record"}},"created_at":"2026-05-17T23:51:56.584989+00:00","updated_at":"2026-05-17T23:51:56.584989+00:00"}