{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BJWNRWVSGEFOTT3WWSC4YQHOJY","short_pith_number":"pith:BJWNRWVS","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"},"canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","source":{"kind":"arxiv","id":"1903.02167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02167","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02167v1","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02167","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"BJWNRWVSGEFO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BJWNRWVSGEFOTT3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BJWNRWVS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BJWNRWVSGEFOTT3WWSC4YQHOJY","target":"record","payload":{"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"},"canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","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"},"source_kind":"arxiv","source_id":"1903.02167","source_version":1,"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:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5gaAJJKgIY4P84355D7shmGN1iz9L6adYqgnWBEbwPrKB2+dHIqJ/4P5wuNZrn1IL7fraoo6wNlDUxIYx8tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:17.814203Z"},"content_sha256":"bcca15626d548ba4fa54287a1ad65a8db21181649b20f1ef4cd5d4b23c7680b4","schema_version":"1.0","event_id":"sha256:bcca15626d548ba4fa54287a1ad65a8db21181649b20f1ef4cd5d4b23c7680b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BJWNRWVSGEFOTT3WWSC4YQHOJY","target":"graph","payload":{"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"},"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:51:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0x3bEaBxGDmG24yfPHdclLgjx/pDsh7aRfH2QLU6mpGqxqvDSaQgjnVfrsvqUty7+akGo8rXPhaePEi0vt4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:26:17.814557Z"},"content_sha256":"057afff2987f65a2ff4a4e2fd54a11b3275d09b3edab6ff1af419996f7ca5e93","schema_version":"1.0","event_id":"sha256:057afff2987f65a2ff4a4e2fd54a11b3275d09b3edab6ff1af419996f7ca5e93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/bundle.json","state_url":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/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-06-01T21:26:17Z","links":{"resolver":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY","bundle":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/bundle.json","state":"https://pith.science/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJWNRWVSGEFOTT3WWSC4YQHOJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BJWNRWVSGEFOTT3WWSC4YQHOJY","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":"e5447623a5a0f404ad2fca89a409cde127c62d5484fc1513e74416b94ded531b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-06T04:13:28Z","title_canon_sha256":"0df0b537752aec6dfcf81a5cd094b25b72fec7a1ca17be11d669783a8cc3d50a"},"schema_version":"1.0","source":{"id":"1903.02167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.02167","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"arxiv_version","alias_value":"1903.02167v1","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02167","created_at":"2026-05-17T23:51:56Z"},{"alias_kind":"pith_short_12","alias_value":"BJWNRWVSGEFO","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BJWNRWVSGEFOTT3W","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BJWNRWVS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:057afff2987f65a2ff4a4e2fd54a11b3275d09b3edab6ff1af419996f7ca5e93","target":"graph","created_at":"2026-05-17T23:51:56Z","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":"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","authors_text":"Christine A. Shoemaker, Taimoor Akhtar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-06T04:13:28Z","title":"Efficient Multi-Objective Optimization through Population-based Parallel Surrogate Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02167","kind":"arxiv","version":1},"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:bcca15626d548ba4fa54287a1ad65a8db21181649b20f1ef4cd5d4b23c7680b4","target":"record","created_at":"2026-05-17T23:51:56Z","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":"e5447623a5a0f404ad2fca89a409cde127c62d5484fc1513e74416b94ded531b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-03-06T04:13:28Z","title_canon_sha256":"0df0b537752aec6dfcf81a5cd094b25b72fec7a1ca17be11d669783a8cc3d50a"},"schema_version":"1.0","source":{"id":"1903.02167","kind":"arxiv","version":1}},"canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a6cd8dab2310ae9cf76b485cc40ee4e144fdec9bb7c64a9c07ec5b4b48eec60","first_computed_at":"2026-05-17T23:51:56.584914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:56.584914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TnlNNe/2Xckt8XMZG0qpPystzv8uSrLtU5MKtDK9H6LekrSYVmAKSkA0LMizvG8sPH/zbLp5T7UO01QE5X+jCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:56.585421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.02167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcca15626d548ba4fa54287a1ad65a8db21181649b20f1ef4cd5d4b23c7680b4","sha256:057afff2987f65a2ff4a4e2fd54a11b3275d09b3edab6ff1af419996f7ca5e93"],"state_sha256":"95eb25b7e53bd5f9b5651dc03ae3e6b540b3c306d177248c2fc78439e4c317fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/mAA4IZdH8RqujpRNwQyL3c5XBMAIo2zWdXOKGLxaF9DSBJ3764n4fYP4odp+hCgaw7ctYqPb8fvbCGv7iHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:26:17.816402Z","bundle_sha256":"ef64d3f9f38f728c287e7be02643840bf676ea9fb93704a64dfa994c40797e3a"}}