{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AP4MXXNGFEZDECVKNK4V6BEM47","short_pith_number":"pith:AP4MXXNG","schema_version":"1.0","canonical_sha256":"03f8cbdda62932320aaa6ab95f048ce7fcbae4912a2757b3cb16098798a0d0d0","source":{"kind":"arxiv","id":"2306.01095","version":4},"attestation_state":"computed","paper":{"title":"Large-Batch, Iteration-Efficient Neural Bayesian Design Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CE"],"primary_cat":"cs.LG","authors_text":"Alireza Javanmardi, Eyke H\\\"ullermeier, Hans-Peter Seidel, Navid Ansari, Vahid Babaei","submitted_at":"2023-06-01T19:10:57Z","abstract_excerpt":"Bayesian optimization (BO) provides a powerful framework for optimizing black-box, expensive-to-evaluate functions. It is therefore an attractive tool for engineering design problems, typically involving multiple objectives. Thanks to the rapid advances in fabrication and measurement methods as well as parallel computing infrastructure, querying many design problems can be heavily parallelized. This class of problems challenges BO with an unprecedented setup where it has to deal with very large batches, shifting its focus from sample efficiency to iteration efficiency. We present a novel Bayes"},"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":"2306.01095","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-01T19:10:57Z","cross_cats_sorted":["cs.AI","cs.CE"],"title_canon_sha256":"8967a57ec0abf870519ba7209c475bdc2e148310deb3d854ed0447ce2769c366","abstract_canon_sha256":"07cfe544e4a8a48ec615ad52839e77fdb95d888556477551805706307b64f6f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:03:39.628946Z","signature_b64":"7i0y25WG/Rw3ieIluyTFsDxkf2wkwI8UNadzx6Qpk+rvH6dOwEzWAA3pAl1D/tZeH2tee6nBl85pcxjz7erIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03f8cbdda62932320aaa6ab95f048ce7fcbae4912a2757b3cb16098798a0d0d0","last_reissued_at":"2026-07-05T09:03:39.628357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:03:39.628357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-Batch, Iteration-Efficient Neural Bayesian Design Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CE"],"primary_cat":"cs.LG","authors_text":"Alireza Javanmardi, Eyke H\\\"ullermeier, Hans-Peter Seidel, Navid Ansari, Vahid Babaei","submitted_at":"2023-06-01T19:10:57Z","abstract_excerpt":"Bayesian optimization (BO) provides a powerful framework for optimizing black-box, expensive-to-evaluate functions. It is therefore an attractive tool for engineering design problems, typically involving multiple objectives. Thanks to the rapid advances in fabrication and measurement methods as well as parallel computing infrastructure, querying many design problems can be heavily parallelized. This class of problems challenges BO with an unprecedented setup where it has to deal with very large batches, shifting its focus from sample efficiency to iteration efficiency. We present a novel Bayes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01095","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/2306.01095/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":"2306.01095","created_at":"2026-07-05T09:03:39.628417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.01095v4","created_at":"2026-07-05T09:03:39.628417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01095","created_at":"2026-07-05T09:03:39.628417+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP4MXXNGFEZD","created_at":"2026-07-05T09:03:39.628417+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP4MXXNGFEZDECVK","created_at":"2026-07-05T09:03:39.628417+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP4MXXNG","created_at":"2026-07-05T09:03:39.628417+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13738","citing_title":"Uncertainty separation via ensemble quantile regression","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47","json":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47.json","graph_json":"https://pith.science/api/pith-number/AP4MXXNGFEZDECVKNK4V6BEM47/graph.json","events_json":"https://pith.science/api/pith-number/AP4MXXNGFEZDECVKNK4V6BEM47/events.json","paper":"https://pith.science/paper/AP4MXXNG"},"agent_actions":{"view_html":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47","download_json":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47.json","view_paper":"https://pith.science/paper/AP4MXXNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.01095&json=true","fetch_graph":"https://pith.science/api/pith-number/AP4MXXNGFEZDECVKNK4V6BEM47/graph.json","fetch_events":"https://pith.science/api/pith-number/AP4MXXNGFEZDECVKNK4V6BEM47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47/action/storage_attestation","attest_author":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47/action/author_attestation","sign_citation":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47/action/citation_signature","submit_replication":"https://pith.science/pith/AP4MXXNGFEZDECVKNK4V6BEM47/action/replication_record"}},"created_at":"2026-07-05T09:03:39.628417+00:00","updated_at":"2026-07-05T09:03:39.628417+00:00"}