{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MDSRYQLNWM5F7RNTJD6AYKHXUK","short_pith_number":"pith:MDSRYQLN","canonical_record":{"source":{"id":"1811.01323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-04T05:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"06af489f4017a27079edc55992c7372e270df98d7f0a468654a2810651d44cc8","abstract_canon_sha256":"27c05fda0e8406100a101dd5c1b4b7e52a214e4a1c09f49dc59cac6fe38b9158"},"schema_version":"1.0"},"canonical_sha256":"60e51c416db33a5fc5b348fc0c28f7a2a288d655e1b9cecadc0ef221b0624704","source":{"kind":"arxiv","id":"1811.01323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01323","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01323v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01323","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"MDSRYQLNWM5F","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDSRYQLNWM5F7RNT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDSRYQLN","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MDSRYQLNWM5F7RNTJD6AYKHXUK","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-04T05:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"06af489f4017a27079edc55992c7372e270df98d7f0a468654a2810651d44cc8","abstract_canon_sha256":"27c05fda0e8406100a101dd5c1b4b7e52a214e4a1c09f49dc59cac6fe38b9158"},"schema_version":"1.0"},"canonical_sha256":"60e51c416db33a5fc5b348fc0c28f7a2a288d655e1b9cecadc0ef221b0624704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.617837Z","signature_b64":"ptzOlAO9Th5Pw9j0pdnougMXFR26EBpBP41vBqo5+9UosTju5Yc5x11aroIDlUuuik+l8FWq6kfZ451rqoMWBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e51c416db33a5fc5b348fc0c28f7a2a288d655e1b9cecadc0ef221b0624704","last_reissued_at":"2026-05-18T00:01:34.617186Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.617186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01323","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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G269qypjR0F7pTaVSaASL+AseBgimCYtFdl246XNn7PA9Y1/H6g0R0q4L5RBxeW7xxKfaGNGJZt3JMmdCfTkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:44.499621Z"},"content_sha256":"348999654ee8ac3a12af612266b1a5961aa74f93327a970ff413074d75d8987e","schema_version":"1.0","event_id":"sha256:348999654ee8ac3a12af612266b1a5961aa74f93327a970ff413074d75d8987e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MDSRYQLNWM5F7RNTJD6AYKHXUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Batched Scalable Multi-Objective Bayesian Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Hui-Ling Zhen, Qingfu Zhang, Sam Kwong, Xi Lin, Zhenhua Li","submitted_at":"2018-11-04T05:00:47Z","abstract_excerpt":"The surrogate-assisted optimization algorithm is a promising approach for solving expensive multi-objective optimization problems. However, most existing surrogate-assisted multi-objective optimization algorithms have three main drawbacks: 1) cannot scale well for solving problems with high dimensional decision space, 2) cannot incorporate available gradient information, and 3) do not support batch optimization. These drawbacks prevent their use for solving many real-world large scale optimization problems. This paper proposes a batched scalable multi-objective Bayesian optimization algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01323","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-18T00:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4VBZ6jvjzAG983TDbaCPPhTYNFocegl5301VsPpzXRoYFCbv+Pc0g3Uejvaha9D266EY0vysukefRcyNUzWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:39:44.499969Z"},"content_sha256":"c0cf8ec48552933636675a112915457491892b534614c6f6cc69a3333acc4c70","schema_version":"1.0","event_id":"sha256:c0cf8ec48552933636675a112915457491892b534614c6f6cc69a3333acc4c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/bundle.json","state_url":"https://pith.science/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/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-01T18:39:44Z","links":{"resolver":"https://pith.science/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK","bundle":"https://pith.science/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/bundle.json","state":"https://pith.science/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDSRYQLNWM5F7RNTJD6AYKHXUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MDSRYQLNWM5F7RNTJD6AYKHXUK","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":"27c05fda0e8406100a101dd5c1b4b7e52a214e4a1c09f49dc59cac6fe38b9158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-04T05:00:47Z","title_canon_sha256":"06af489f4017a27079edc55992c7372e270df98d7f0a468654a2810651d44cc8"},"schema_version":"1.0","source":{"id":"1811.01323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01323","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01323v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01323","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"MDSRYQLNWM5F","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDSRYQLNWM5F7RNT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDSRYQLN","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:c0cf8ec48552933636675a112915457491892b534614c6f6cc69a3333acc4c70","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"The surrogate-assisted optimization algorithm is a promising approach for solving expensive multi-objective optimization problems. However, most existing surrogate-assisted multi-objective optimization algorithms have three main drawbacks: 1) cannot scale well for solving problems with high dimensional decision space, 2) cannot incorporate available gradient information, and 3) do not support batch optimization. These drawbacks prevent their use for solving many real-world large scale optimization problems. This paper proposes a batched scalable multi-objective Bayesian optimization algorithm ","authors_text":"Hui-Ling Zhen, Qingfu Zhang, Sam Kwong, Xi Lin, Zhenhua Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-04T05:00:47Z","title":"A Batched Scalable Multi-Objective Bayesian Optimization Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01323","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:348999654ee8ac3a12af612266b1a5961aa74f93327a970ff413074d75d8987e","target":"record","created_at":"2026-05-18T00:01:34Z","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":"27c05fda0e8406100a101dd5c1b4b7e52a214e4a1c09f49dc59cac6fe38b9158","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-04T05:00:47Z","title_canon_sha256":"06af489f4017a27079edc55992c7372e270df98d7f0a468654a2810651d44cc8"},"schema_version":"1.0","source":{"id":"1811.01323","kind":"arxiv","version":1}},"canonical_sha256":"60e51c416db33a5fc5b348fc0c28f7a2a288d655e1b9cecadc0ef221b0624704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60e51c416db33a5fc5b348fc0c28f7a2a288d655e1b9cecadc0ef221b0624704","first_computed_at":"2026-05-18T00:01:34.617186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.617186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ptzOlAO9Th5Pw9j0pdnougMXFR26EBpBP41vBqo5+9UosTju5Yc5x11aroIDlUuuik+l8FWq6kfZ451rqoMWBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.617837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:348999654ee8ac3a12af612266b1a5961aa74f93327a970ff413074d75d8987e","sha256:c0cf8ec48552933636675a112915457491892b534614c6f6cc69a3333acc4c70"],"state_sha256":"16b175261ab37c4e3780a2772171c17a8a16efa0487c6313c7d1a08e3546959f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9AZs9K/apCfkZdG0qM6oHjD08nc1TWqLMS3LLQLT6b5JLpIZFVHHueclTZH6JILqNChcS+b9YJzfGlBLaNpQAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:39:44.502102Z","bundle_sha256":"11d99875c04a9048efa651214c17e61189f32b1a29a0ab429bd1b16a78ed8a56"}}