{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AUQNZHLCSMVGCFUMIPMW73RUSB","short_pith_number":"pith:AUQNZHLC","schema_version":"1.0","canonical_sha256":"0520dc9d62932a61168c43d96fee3490548e58917acadf1652d29e52074ab54e","source":{"kind":"arxiv","id":"2210.10953","version":4},"attestation_state":"computed","paper":{"title":"Discovering Many Diverse Solutions with Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Jacob Gardner, Kaiwen Wu, Natalie Maus","submitted_at":"2022-10-20T01:56:38Z","abstract_excerpt":"Bayesian optimization (BO) is a popular approach for sample-efficient optimization of black-box objective functions. While BO has been successfully applied to a wide range of scientific applications, traditional approaches to single-objective BO only seek to find a single best solution. This can be a significant limitation in situations where solutions may later turn out to be intractable. For example, a designed molecule may turn out to violate constraints that can only be reasonably evaluated after the optimization process has concluded. To address this issue, we propose Rank-Ordered Bayesia"},"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":"2210.10953","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-20T01:56:38Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"50e9c14d7b2702c97afcff826836465664d8e773f0ee847497985e4321b95ff2","abstract_canon_sha256":"c00bdcd0ae9a6655a292cb45d1d84aa926a2d1633d9c8c6f27572746e33ead8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:29.019336Z","signature_b64":"oR3DlBrAWgrZxI2Q9wjSYejmEqDNPa9S4CbuzEc2te/jNHaSedKZud0qSKGdACE8EshLaSdVPjRljDEquxblDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0520dc9d62932a61168c43d96fee3490548e58917acadf1652d29e52074ab54e","last_reissued_at":"2026-07-05T06:06:29.018902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:29.018902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discovering Many Diverse Solutions with Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Jacob Gardner, Kaiwen Wu, Natalie Maus","submitted_at":"2022-10-20T01:56:38Z","abstract_excerpt":"Bayesian optimization (BO) is a popular approach for sample-efficient optimization of black-box objective functions. While BO has been successfully applied to a wide range of scientific applications, traditional approaches to single-objective BO only seek to find a single best solution. This can be a significant limitation in situations where solutions may later turn out to be intractable. For example, a designed molecule may turn out to violate constraints that can only be reasonably evaluated after the optimization process has concluded. To address this issue, we propose Rank-Ordered Bayesia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10953","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.10953/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.10953","created_at":"2026-07-05T06:06:29.018966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10953v4","created_at":"2026-07-05T06:06:29.018966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10953","created_at":"2026-07-05T06:06:29.018966+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUQNZHLCSMVG","created_at":"2026-07-05T06:06:29.018966+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUQNZHLCSMVGCFUM","created_at":"2026-07-05T06:06:29.018966+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUQNZHLC","created_at":"2026-07-05T06:06:29.018966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03910","citing_title":"Return of the Latent Space COWBOYS: Re-thinking the use of VAEs for Bayesian Optimisation of Structured Spaces","ref_index":2025,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB","json":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB.json","graph_json":"https://pith.science/api/pith-number/AUQNZHLCSMVGCFUMIPMW73RUSB/graph.json","events_json":"https://pith.science/api/pith-number/AUQNZHLCSMVGCFUMIPMW73RUSB/events.json","paper":"https://pith.science/paper/AUQNZHLC"},"agent_actions":{"view_html":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB","download_json":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB.json","view_paper":"https://pith.science/paper/AUQNZHLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10953&json=true","fetch_graph":"https://pith.science/api/pith-number/AUQNZHLCSMVGCFUMIPMW73RUSB/graph.json","fetch_events":"https://pith.science/api/pith-number/AUQNZHLCSMVGCFUMIPMW73RUSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB/action/storage_attestation","attest_author":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB/action/author_attestation","sign_citation":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB/action/citation_signature","submit_replication":"https://pith.science/pith/AUQNZHLCSMVGCFUMIPMW73RUSB/action/replication_record"}},"created_at":"2026-07-05T06:06:29.018966+00:00","updated_at":"2026-07-05T06:06:29.018966+00:00"}