{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3BRNKNPOFX42U6N2HF4GX5QNU5","short_pith_number":"pith:3BRNKNPO","schema_version":"1.0","canonical_sha256":"d862d535ee2df9aa79ba39786bf60da74221dfc2a2a096d486132fc0a5f76c30","source":{"kind":"arxiv","id":"2003.09436","version":2},"attestation_state":"computed","paper":{"title":"aphBO-2GP-3B: A budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Anh Tran, Jing Sun, Mike Eldred, Robert J. Visintainer, Scott McCann, Tim Wildey","submitted_at":"2020-03-20T18:02:27Z","abstract_excerpt":"High-fidelity complex engineering simulations are highly predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. In this paper, an asynchronous constrained batch-parallel Bayesian optimization method is proposed to efficiently solve the computationally-expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantag"},"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":"2003.09436","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-03-20T18:02:27Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"f7331a8cdefcc231f965270efe7f9228d1eda983b1b8d97e806dc5564fcac7dc","abstract_canon_sha256":"2b537c9d7254fd9dcd0915e5d1fe443604d5cb43f5479697c3920fe3598004d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:52.514571Z","signature_b64":"sF5xJvF5w+UX1MY55f3rr/SHt3aDILwBdjihTOC1WGLGMrVpyAjxrYwHyQNv/SOBQDSaKnLIt6Wz5OV1uN+sDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d862d535ee2df9aa79ba39786bf60da74221dfc2a2a096d486132fc0a5f76c30","last_reissued_at":"2026-07-05T02:12:52.514012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:52.514012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"aphBO-2GP-3B: A budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Anh Tran, Jing Sun, Mike Eldred, Robert J. Visintainer, Scott McCann, Tim Wildey","submitted_at":"2020-03-20T18:02:27Z","abstract_excerpt":"High-fidelity complex engineering simulations are highly predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. In this paper, an asynchronous constrained batch-parallel Bayesian optimization method is proposed to efficiently solve the computationally-expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.09436","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/2003.09436/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":"2003.09436","created_at":"2026-07-05T02:12:52.514073+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.09436v2","created_at":"2026-07-05T02:12:52.514073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.09436","created_at":"2026-07-05T02:12:52.514073+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BRNKNPOFX42","created_at":"2026-07-05T02:12:52.514073+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BRNKNPOFX42U6N2","created_at":"2026-07-05T02:12:52.514073+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BRNKNPO","created_at":"2026-07-05T02:12:52.514073+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00854","citing_title":"High-Dimensional Bayesian Optimization Using Both Random and Supervised Embeddings","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5","json":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5.json","graph_json":"https://pith.science/api/pith-number/3BRNKNPOFX42U6N2HF4GX5QNU5/graph.json","events_json":"https://pith.science/api/pith-number/3BRNKNPOFX42U6N2HF4GX5QNU5/events.json","paper":"https://pith.science/paper/3BRNKNPO"},"agent_actions":{"view_html":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5","download_json":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5.json","view_paper":"https://pith.science/paper/3BRNKNPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.09436&json=true","fetch_graph":"https://pith.science/api/pith-number/3BRNKNPOFX42U6N2HF4GX5QNU5/graph.json","fetch_events":"https://pith.science/api/pith-number/3BRNKNPOFX42U6N2HF4GX5QNU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5/action/storage_attestation","attest_author":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5/action/author_attestation","sign_citation":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5/action/citation_signature","submit_replication":"https://pith.science/pith/3BRNKNPOFX42U6N2HF4GX5QNU5/action/replication_record"}},"created_at":"2026-07-05T02:12:52.514073+00:00","updated_at":"2026-07-05T02:12:52.514073+00:00"}