{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VABNEFNCSQ3TI6BDFACPRZDBHE","short_pith_number":"pith:VABNEFNC","schema_version":"1.0","canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","source":{"kind":"arxiv","id":"2503.01126","version":2},"attestation_state":"computed","paper":{"title":"Constrained multi-fidelity Bayesian optimization with automatic stop condition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Ramin Bostanabad, Zahra Zanjani Foumani","submitted_at":"2025-03-03T03:13:35Z","abstract_excerpt":"Bayesian optimization (BO) is increasingly employed in critical applications to find the optimal design with minimal cost. While BO is known for its sample efficiency, relying solely on costly high-fidelity data can still result in high costs. This is especially the case in constrained search spaces where BO must not only optimize but also ensure feasibility. A related issue in the BO literature is the lack of a systematic stopping criterion. To solve these challenges, we develop a constrained cost-aware multi-fidelity BO (CMFBO) framework whose goal is to minimize overall sampling costs by ut"},"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":"2503.01126","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-03T03:13:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d6adfd7b71a02fdc8061a8255b0fd071b082a31e236b55ca625fa70966071023","abstract_canon_sha256":"0c6bb46b205beccb970663719182cb143a8b3f30ebe3ccf8f227c9d3a588e75a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:45.927739Z","signature_b64":"qbUPqn6EztMJZT4X0sZTPeTBRacXrYIy3r/81jWi0/1JTRpApG3sABOSH1Hg46pjGwHhkVl7Y0mrP1CUK62RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","last_reissued_at":"2026-07-05T10:37:45.926964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:45.926964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained multi-fidelity Bayesian optimization with automatic stop condition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Ramin Bostanabad, Zahra Zanjani Foumani","submitted_at":"2025-03-03T03:13:35Z","abstract_excerpt":"Bayesian optimization (BO) is increasingly employed in critical applications to find the optimal design with minimal cost. While BO is known for its sample efficiency, relying solely on costly high-fidelity data can still result in high costs. This is especially the case in constrained search spaces where BO must not only optimize but also ensure feasibility. A related issue in the BO literature is the lack of a systematic stopping criterion. To solve these challenges, we develop a constrained cost-aware multi-fidelity BO (CMFBO) framework whose goal is to minimize overall sampling costs by ut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01126","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/2503.01126/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":"2503.01126","created_at":"2026-07-05T10:37:45.927044+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.01126v2","created_at":"2026-07-05T10:37:45.927044+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01126","created_at":"2026-07-05T10:37:45.927044+00:00"},{"alias_kind":"pith_short_12","alias_value":"VABNEFNCSQ3T","created_at":"2026-07-05T10:37:45.927044+00:00"},{"alias_kind":"pith_short_16","alias_value":"VABNEFNCSQ3TI6BD","created_at":"2026-07-05T10:37:45.927044+00:00"},{"alias_kind":"pith_short_8","alias_value":"VABNEFNC","created_at":"2026-07-05T10:37:45.927044+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00865","citing_title":"Constrained Bayesian Optimisation with Multiple Information Sources","ref_index":60,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE","json":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE.json","graph_json":"https://pith.science/api/pith-number/VABNEFNCSQ3TI6BDFACPRZDBHE/graph.json","events_json":"https://pith.science/api/pith-number/VABNEFNCSQ3TI6BDFACPRZDBHE/events.json","paper":"https://pith.science/paper/VABNEFNC"},"agent_actions":{"view_html":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE","download_json":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE.json","view_paper":"https://pith.science/paper/VABNEFNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.01126&json=true","fetch_graph":"https://pith.science/api/pith-number/VABNEFNCSQ3TI6BDFACPRZDBHE/graph.json","fetch_events":"https://pith.science/api/pith-number/VABNEFNCSQ3TI6BDFACPRZDBHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/action/storage_attestation","attest_author":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/action/author_attestation","sign_citation":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/action/citation_signature","submit_replication":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/action/replication_record"}},"created_at":"2026-07-05T10:37:45.927044+00:00","updated_at":"2026-07-05T10:37:45.927044+00:00"}