{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WOZXAL4B7UTXHTKCCS5BGSKIOU","short_pith_number":"pith:WOZXAL4B","schema_version":"1.0","canonical_sha256":"b3b3702f81fd2773cd4214ba134948752f35e8068d225826ed57648501d8d264","source":{"kind":"arxiv","id":"2210.10199","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Eytan Bakshy, Maximilian Balandat, Michael A. Osborne, Samuel Daulton, Xingchen Wan","submitted_at":"2022-10-18T22:41:00Z","abstract_excerpt":"Optimizing expensive-to-evaluate black-box functions of discrete (and potentially continuous) design parameters is a ubiquitous problem in scientific and engineering applications. Bayesian optimization (BO) is a popular, sample-efficient method that leverages a probabilistic surrogate model and an acquisition function (AF) to select promising designs to evaluate. However, maximizing the AF over mixed or high-cardinality discrete search spaces is challenging standard gradient-based methods cannot be used directly or evaluating the AF at every point in the search space would be computationally p"},"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.10199","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-18T22:41:00Z","cross_cats_sorted":["cs.AI","math.OC","stat.ML"],"title_canon_sha256":"1e070e42af60cd1c14b96a1d965b0d507f41f67f92e649197aa5c94f3f5e96c1","abstract_canon_sha256":"fbf3d643e6dd8dac0a8b4c9e34e5f608733b397b834cd16292dbc0e6167c7593"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:07.236872Z","signature_b64":"hsZ2zOurIeXl3W3nSypw6QwhN1OyN3OL3I4rQp3cT2QLc3d/dzRZ6JUHK7a2ZmcRbsdo7Mlnp3NT0nZLVnP6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3b3702f81fd2773cd4214ba134948752f35e8068d225826ed57648501d8d264","last_reissued_at":"2026-07-05T05:08:07.236391Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:07.236391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Eriksson, Eytan Bakshy, Maximilian Balandat, Michael A. Osborne, Samuel Daulton, Xingchen Wan","submitted_at":"2022-10-18T22:41:00Z","abstract_excerpt":"Optimizing expensive-to-evaluate black-box functions of discrete (and potentially continuous) design parameters is a ubiquitous problem in scientific and engineering applications. Bayesian optimization (BO) is a popular, sample-efficient method that leverages a probabilistic surrogate model and an acquisition function (AF) to select promising designs to evaluate. However, maximizing the AF over mixed or high-cardinality discrete search spaces is challenging standard gradient-based methods cannot be used directly or evaluating the AF at every point in the search space would be computationally p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10199","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.10199/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.10199","created_at":"2026-07-05T05:08:07.236450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10199v1","created_at":"2026-07-05T05:08:07.236450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10199","created_at":"2026-07-05T05:08:07.236450+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOZXAL4B7UTX","created_at":"2026-07-05T05:08:07.236450+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOZXAL4B7UTXHTKC","created_at":"2026-07-05T05:08:07.236450+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOZXAL4B","created_at":"2026-07-05T05:08:07.236450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07416","citing_title":"Bayesian Optimization for Mixed-Variable Problems in the Natural Sciences","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU","json":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU.json","graph_json":"https://pith.science/api/pith-number/WOZXAL4B7UTXHTKCCS5BGSKIOU/graph.json","events_json":"https://pith.science/api/pith-number/WOZXAL4B7UTXHTKCCS5BGSKIOU/events.json","paper":"https://pith.science/paper/WOZXAL4B"},"agent_actions":{"view_html":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU","download_json":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU.json","view_paper":"https://pith.science/paper/WOZXAL4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10199&json=true","fetch_graph":"https://pith.science/api/pith-number/WOZXAL4B7UTXHTKCCS5BGSKIOU/graph.json","fetch_events":"https://pith.science/api/pith-number/WOZXAL4B7UTXHTKCCS5BGSKIOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU/action/storage_attestation","attest_author":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU/action/author_attestation","sign_citation":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU/action/citation_signature","submit_replication":"https://pith.science/pith/WOZXAL4B7UTXHTKCCS5BGSKIOU/action/replication_record"}},"created_at":"2026-07-05T05:08:07.236450+00:00","updated_at":"2026-07-05T05:08:07.236450+00:00"}