{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JKV23QA5HCQFELEE2AODCG6FGA","short_pith_number":"pith:JKV23QA5","schema_version":"1.0","canonical_sha256":"4aabadc01d38a0522c84d01c311bc53017f33db41d3383e89f780e4ad6c50583","source":{"kind":"arxiv","id":"2007.00925","version":1},"attestation_state":"computed","paper":{"title":"High Dimensional Bayesian Optimization Assisted by Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Elena Raponi, Hao Wang, Mariusz Bujny, Simonetta Boria","submitted_at":"2020-07-02T07:03:27Z","abstract_excerpt":"Bayesian Optimization (BO) is a surrogate-assisted global optimization technique that has been successfully applied in various fields, e.g., automated machine learning and design optimization. Built upon a so-called infill-criterion and Gaussian Process regression (GPR), the BO technique suffers from a substantial computational complexity and hampered convergence rate as the dimension of the search spaces increases. Scaling up BO for high-dimensional optimization problems remains a challenging task. In this paper, we propose to tackle the scalability of BO by hybridizing it with a Principal Co"},"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":"2007.00925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2020-07-02T07:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"35d6a44b1850198059f445112343a748b1442a6062cb7e7edc39fdb5df968958","abstract_canon_sha256":"fc6823d42f635afaf037c4c270495e9151c98456120b8aff032c60602fd5e15d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:15:42.768430Z","signature_b64":"GY0devDpd///XJifarWK3HJXXDqtWJz4AykDYVEQ+Zen+rGcECeGhp1WByZrA3BADBz3XxTzIzK47yMIqyuEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aabadc01d38a0522c84d01c311bc53017f33db41d3383e89f780e4ad6c50583","last_reissued_at":"2026-07-05T01:15:42.767955Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:15:42.767955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Bayesian Optimization Assisted by Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Carola Doerr, Elena Raponi, Hao Wang, Mariusz Bujny, Simonetta Boria","submitted_at":"2020-07-02T07:03:27Z","abstract_excerpt":"Bayesian Optimization (BO) is a surrogate-assisted global optimization technique that has been successfully applied in various fields, e.g., automated machine learning and design optimization. Built upon a so-called infill-criterion and Gaussian Process regression (GPR), the BO technique suffers from a substantial computational complexity and hampered convergence rate as the dimension of the search spaces increases. Scaling up BO for high-dimensional optimization problems remains a challenging task. In this paper, we propose to tackle the scalability of BO by hybridizing it with a Principal Co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.00925","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/2007.00925/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":"2007.00925","created_at":"2026-07-05T01:15:42.768024+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.00925v1","created_at":"2026-07-05T01:15:42.768024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.00925","created_at":"2026-07-05T01:15:42.768024+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKV23QA5HCQF","created_at":"2026-07-05T01:15:42.768024+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKV23QA5HCQFELEE","created_at":"2026-07-05T01:15:42.768024+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKV23QA5","created_at":"2026-07-05T01:15:42.768024+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15679","citing_title":"High-Dimensional Bayesian Optimisation with Large-Scale Constraints via Latent Space Gaussian Processes","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA","json":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA.json","graph_json":"https://pith.science/api/pith-number/JKV23QA5HCQFELEE2AODCG6FGA/graph.json","events_json":"https://pith.science/api/pith-number/JKV23QA5HCQFELEE2AODCG6FGA/events.json","paper":"https://pith.science/paper/JKV23QA5"},"agent_actions":{"view_html":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA","download_json":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA.json","view_paper":"https://pith.science/paper/JKV23QA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.00925&json=true","fetch_graph":"https://pith.science/api/pith-number/JKV23QA5HCQFELEE2AODCG6FGA/graph.json","fetch_events":"https://pith.science/api/pith-number/JKV23QA5HCQFELEE2AODCG6FGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA/action/storage_attestation","attest_author":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA/action/author_attestation","sign_citation":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA/action/citation_signature","submit_replication":"https://pith.science/pith/JKV23QA5HCQFELEE2AODCG6FGA/action/replication_record"}},"created_at":"2026-07-05T01:15:42.768024+00:00","updated_at":"2026-07-05T01:15:42.768024+00:00"}