{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HIYTFJF2OBMREYG7D4IXHDFT4H","short_pith_number":"pith:HIYTFJF2","schema_version":"1.0","canonical_sha256":"3a3132a4ba70591260df1f11738cb3e1e2a4edeef35515ca1a4cc53ccd7f1750","source":{"kind":"arxiv","id":"2109.09264","version":2},"attestation_state":"computed","paper":{"title":"Computationally Efficient High-Dimensional Bayesian Optimization via Variable Selection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Kingsford, Yihang Shen","submitted_at":"2021-09-20T01:55:43Z","abstract_excerpt":"Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms that scale to functions with high-dimensional domains is still a challenge. Optimizing such functions by vanilla BO is extremely time-consuming. Alternative strategies for high-dimensional BO that are based on the idea of embedding the high-dimensional space to the one with low dimension are sensitive to the choice of the embedding dimension, which needs to be pre-specified. We develop a new computationally efficient hi"},"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":"2109.09264","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-20T01:55:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0069bcb2594412d742ba204e02f1244cf96fa462a5b61a0cf1e7039b8808e418","abstract_canon_sha256":"53e0262bbfb82d5e28980bb18d0d8031df7a137c00d2d940cdd8864628c93ea7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:49.680721Z","signature_b64":"vRYfHqRjajjeTuOj/O3n9ypJkE88rihoCG7n9YRnbR3WHEeEOQqZo6DDkRCh3aSy1FS1CvzbO7CeTqUp6yVVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3132a4ba70591260df1f11738cb3e1e2a4edeef35515ca1a4cc53ccd7f1750","last_reissued_at":"2026-07-05T07:43:49.680183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:49.680183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computationally Efficient High-Dimensional Bayesian Optimization via Variable Selection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Carl Kingsford, Yihang Shen","submitted_at":"2021-09-20T01:55:43Z","abstract_excerpt":"Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms that scale to functions with high-dimensional domains is still a challenge. Optimizing such functions by vanilla BO is extremely time-consuming. Alternative strategies for high-dimensional BO that are based on the idea of embedding the high-dimensional space to the one with low dimension are sensitive to the choice of the embedding dimension, which needs to be pre-specified. We develop a new computationally efficient hi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09264","kind":"arxiv","version":2},"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/2109.09264/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":"2109.09264","created_at":"2026-07-05T07:43:49.680238+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.09264v2","created_at":"2026-07-05T07:43:49.680238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09264","created_at":"2026-07-05T07:43:49.680238+00:00"},{"alias_kind":"pith_short_12","alias_value":"HIYTFJF2OBMR","created_at":"2026-07-05T07:43:49.680238+00:00"},{"alias_kind":"pith_short_16","alias_value":"HIYTFJF2OBMREYG7","created_at":"2026-07-05T07:43:49.680238+00:00"},{"alias_kind":"pith_short_8","alias_value":"HIYTFJF2","created_at":"2026-07-05T07:43:49.680238+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21321","citing_title":"Bencher: Simple and Reproducible Benchmarking for Black-Box Optimization","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H","json":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H.json","graph_json":"https://pith.science/api/pith-number/HIYTFJF2OBMREYG7D4IXHDFT4H/graph.json","events_json":"https://pith.science/api/pith-number/HIYTFJF2OBMREYG7D4IXHDFT4H/events.json","paper":"https://pith.science/paper/HIYTFJF2"},"agent_actions":{"view_html":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H","download_json":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H.json","view_paper":"https://pith.science/paper/HIYTFJF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.09264&json=true","fetch_graph":"https://pith.science/api/pith-number/HIYTFJF2OBMREYG7D4IXHDFT4H/graph.json","fetch_events":"https://pith.science/api/pith-number/HIYTFJF2OBMREYG7D4IXHDFT4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H/action/storage_attestation","attest_author":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H/action/author_attestation","sign_citation":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H/action/citation_signature","submit_replication":"https://pith.science/pith/HIYTFJF2OBMREYG7D4IXHDFT4H/action/replication_record"}},"created_at":"2026-07-05T07:43:49.680238+00:00","updated_at":"2026-07-05T07:43:49.680238+00:00"}