{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VABNEFNCSQ3TI6BDFACPRZDBHE","short_pith_number":"pith:VABNEFNC","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"},"canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","source":{"kind":"arxiv","id":"2503.01126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01126","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01126v2","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01126","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"VABNEFNCSQ3T","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"VABNEFNCSQ3TI6BD","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"VABNEFNC","created_at":"2026-07-05T10:37:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VABNEFNCSQ3TI6BDFACPRZDBHE","target":"record","payload":{"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"},"canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","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"},"source_kind":"arxiv","source_id":"2503.01126","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ee44N+DUrnvIgOnSiqfHGN5bctPPDYtPogmYlnTWQHQjnB/woxnjujhvwVeLtXPBeF86HwH5KzxqlzG1KpRPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:24.352838Z"},"content_sha256":"454c9c2070d6818fafce1ea669587913ad778a4eecb34d59ca6db4db3127e2e8","schema_version":"1.0","event_id":"sha256:454c9c2070d6818fafce1ea669587913ad778a4eecb34d59ca6db4db3127e2e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VABNEFNCSQ3TI6BDFACPRZDBHE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV4gwsIOgaRAcZvJibPNOTMAUMgmFY8XsQV/GPlbrggbtdEMx4mdqTmPF0T6nlGiVUoI8bpoaU8LC1oktZMrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:51:24.353601Z"},"content_sha256":"b94fd72d133ebd20ab099644453b2c8cda95d19774183850834e3760aefa1e46","schema_version":"1.0","event_id":"sha256:b94fd72d133ebd20ab099644453b2c8cda95d19774183850834e3760aefa1e46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/bundle.json","state_url":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-09T06:51:24Z","links":{"resolver":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE","bundle":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/bundle.json","state":"https://pith.science/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VABNEFNCSQ3TI6BDFACPRZDBHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VABNEFNCSQ3TI6BDFACPRZDBHE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0c6bb46b205beccb970663719182cb143a8b3f30ebe3ccf8f227c9d3a588e75a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-03T03:13:35Z","title_canon_sha256":"d6adfd7b71a02fdc8061a8255b0fd071b082a31e236b55ca625fa70966071023"},"schema_version":"1.0","source":{"id":"2503.01126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01126","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01126v2","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01126","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"VABNEFNCSQ3T","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"VABNEFNCSQ3TI6BD","created_at":"2026-07-05T10:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"VABNEFNC","created_at":"2026-07-05T10:37:45Z"}],"graph_snapshots":[{"event_id":"sha256:b94fd72d133ebd20ab099644453b2c8cda95d19774183850834e3760aefa1e46","target":"graph","created_at":"2026-07-05T10:37:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.01126/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ramin Bostanabad, Zahra Zanjani Foumani","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-03T03:13:35Z","title":"Constrained multi-fidelity Bayesian optimization with automatic stop condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01126","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:454c9c2070d6818fafce1ea669587913ad778a4eecb34d59ca6db4db3127e2e8","target":"record","created_at":"2026-07-05T10:37:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0c6bb46b205beccb970663719182cb143a8b3f30ebe3ccf8f227c9d3a588e75a","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-03T03:13:35Z","title_canon_sha256":"d6adfd7b71a02fdc8061a8255b0fd071b082a31e236b55ca625fa70966071023"},"schema_version":"1.0","source":{"id":"2503.01126","kind":"arxiv","version":2}},"canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a802d215a294373478232804f8e461392adb187c6ea5b3b3c35c5aca54cd291d","first_computed_at":"2026-07-05T10:37:45.926964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:45.926964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qbUPqn6EztMJZT4X0sZTPeTBRacXrYIy3r/81jWi0/1JTRpApG3sABOSH1Hg46pjGwHhkVl7Y0mrP1CUK62RCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:45.927739Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.01126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:454c9c2070d6818fafce1ea669587913ad778a4eecb34d59ca6db4db3127e2e8","sha256:b94fd72d133ebd20ab099644453b2c8cda95d19774183850834e3760aefa1e46"],"state_sha256":"1939f08c702449a9888d623f60668388506167ab3ba706e3bf226155e7ecbd0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9hfSNrhY5S4lJfHJXC9w7KcbOhs25fqHfsKOwY+doMnNE23kD3fziqdn0rBmznUJj/d2TocdC5FTclrkGNpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:51:24.361211Z","bundle_sha256":"e5ed09425b1cc9870a1b76041d2ed73f0ea47b4b721e9d36c3a41bd5866c846d"}}