{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:56QSEFEZS54ISGRCP2SQIS47D5","short_pith_number":"pith:56QSEFEZ","canonical_record":{"source":{"id":"1905.02370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-07T06:27:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d10bfbdfb98236711191563f29c3ce11913a67ff3d6baa4c13066b88c449f497","abstract_canon_sha256":"d8f700a7c2d6029a6a2b2eeef06cc3096e14b3885dbb199ca1485e89cb864da1"},"schema_version":"1.0"},"canonical_sha256":"efa12214999778891a227ea5044b9f1f5f392406b020a07f49551b4d03ae9de0","source":{"kind":"arxiv","id":"1905.02370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02370","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02370v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02370","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"56QSEFEZS54I","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"56QSEFEZS54ISGRC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"56QSEFEZ","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:56QSEFEZS54ISGRCP2SQIS47D5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-07T06:27:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d10bfbdfb98236711191563f29c3ce11913a67ff3d6baa4c13066b88c449f497","abstract_canon_sha256":"d8f700a7c2d6029a6a2b2eeef06cc3096e14b3885dbb199ca1485e89cb864da1"},"schema_version":"1.0"},"canonical_sha256":"efa12214999778891a227ea5044b9f1f5f392406b020a07f49551b4d03ae9de0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:51.665864Z","signature_b64":"uIjuxxKiq4ebkNwYCaWPa8aSkbnBl1SMOWn3ukk4i7F/CS5KDV1UnV8XZ/hoP4XqmLSM2dlfPC7Xp6DybhJmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efa12214999778891a227ea5044b9f1f5f392406b020a07f49551b4d03ae9de0","last_reissued_at":"2026-05-17T23:46:51.665183Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:51.665183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02370","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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QKFkG0Tx2rjOKSNPKudM1uCtlo9hTxu998wRrbhGBbOm/48eKpldoEYg0DW4QUqtr8k+DjffjLWzayS/el9GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:12:42.128518Z"},"content_sha256":"38f9a02f58ec197a3010f412561096164cdbe22d74dd06e8349c44dedeacd8aa","schema_version":"1.0","event_id":"sha256:38f9a02f58ec197a3010f412561096164cdbe22d74dd06e8349c44dedeacd8aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:56QSEFEZS54ISGRCP2SQIS47D5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimization for Multi-objective Optimization and Multi-point Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hideitsu Hino, Takashi Wada","submitted_at":"2019-05-07T06:27:27Z","abstract_excerpt":"Bayesian optimization is an effective method to efficiently optimize unknown objective functions with high evaluation costs. Traditional Bayesian optimization algorithms select one point per iteration for single objective function, whereas in recent years, Bayesian optimization for multi-objective optimization or multi-point search per iteration have been proposed. However, Bayesian optimization that can deal with them at the same time in non-heuristic way is not known at present. We propose a Bayesian optimization algorithm that can deal with multi-objective optimization and multi-point searc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02370","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:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQsZgPdy18dS5gUoYJgEH1djNKA49rWaw7HQgbOhjgAzyfpUTx8xCBWnCUwE7riiDFDkZVpeCwCPY3n0z+aAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:12:42.128869Z"},"content_sha256":"ceeaea0bf6918a92095213e1021f691078886d1aae72175ca2043ba4f73ce0da","schema_version":"1.0","event_id":"sha256:ceeaea0bf6918a92095213e1021f691078886d1aae72175ca2043ba4f73ce0da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/56QSEFEZS54ISGRCP2SQIS47D5/bundle.json","state_url":"https://pith.science/pith/56QSEFEZS54ISGRCP2SQIS47D5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/56QSEFEZS54ISGRCP2SQIS47D5/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-05-28T13:12:42Z","links":{"resolver":"https://pith.science/pith/56QSEFEZS54ISGRCP2SQIS47D5","bundle":"https://pith.science/pith/56QSEFEZS54ISGRCP2SQIS47D5/bundle.json","state":"https://pith.science/pith/56QSEFEZS54ISGRCP2SQIS47D5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/56QSEFEZS54ISGRCP2SQIS47D5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:56QSEFEZS54ISGRCP2SQIS47D5","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":"d8f700a7c2d6029a6a2b2eeef06cc3096e14b3885dbb199ca1485e89cb864da1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-07T06:27:27Z","title_canon_sha256":"d10bfbdfb98236711191563f29c3ce11913a67ff3d6baa4c13066b88c449f497"},"schema_version":"1.0","source":{"id":"1905.02370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02370","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02370v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02370","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"56QSEFEZS54I","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"56QSEFEZS54ISGRC","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"56QSEFEZ","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ceeaea0bf6918a92095213e1021f691078886d1aae72175ca2043ba4f73ce0da","target":"graph","created_at":"2026-05-17T23:46:51Z","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":"Bayesian optimization is an effective method to efficiently optimize unknown objective functions with high evaluation costs. Traditional Bayesian optimization algorithms select one point per iteration for single objective function, whereas in recent years, Bayesian optimization for multi-objective optimization or multi-point search per iteration have been proposed. However, Bayesian optimization that can deal with them at the same time in non-heuristic way is not known at present. We propose a Bayesian optimization algorithm that can deal with multi-objective optimization and multi-point searc","authors_text":"Hideitsu Hino, Takashi Wada","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-07T06:27:27Z","title":"Bayesian Optimization for Multi-objective Optimization and Multi-point Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02370","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:38f9a02f58ec197a3010f412561096164cdbe22d74dd06e8349c44dedeacd8aa","target":"record","created_at":"2026-05-17T23:46:51Z","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":"d8f700a7c2d6029a6a2b2eeef06cc3096e14b3885dbb199ca1485e89cb864da1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-07T06:27:27Z","title_canon_sha256":"d10bfbdfb98236711191563f29c3ce11913a67ff3d6baa4c13066b88c449f497"},"schema_version":"1.0","source":{"id":"1905.02370","kind":"arxiv","version":1}},"canonical_sha256":"efa12214999778891a227ea5044b9f1f5f392406b020a07f49551b4d03ae9de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efa12214999778891a227ea5044b9f1f5f392406b020a07f49551b4d03ae9de0","first_computed_at":"2026-05-17T23:46:51.665183Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:51.665183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uIjuxxKiq4ebkNwYCaWPa8aSkbnBl1SMOWn3ukk4i7F/CS5KDV1UnV8XZ/hoP4XqmLSM2dlfPC7Xp6DybhJmDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:51.665864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38f9a02f58ec197a3010f412561096164cdbe22d74dd06e8349c44dedeacd8aa","sha256:ceeaea0bf6918a92095213e1021f691078886d1aae72175ca2043ba4f73ce0da"],"state_sha256":"3d477f61a5c071a04fbd29f72ffce8c0d04ce21d285dbdba7aa10c49ec69ce3f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5eoOI+PbZr4bzRjM0tifpo4+iMqo9ivuIpGh1OW7Tt9ohMhD20vBaNKwWcjcUQbRSKn9CGgOMrIfOobb51MDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:12:42.130813Z","bundle_sha256":"1fa4cbbfcf3dc1b393f31626c921a64cdd6c70dd616597b0f1fab6be5f7a0f68"}}