{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:J4TF2VFN4ISXMVAKWPB2XCIMPF","short_pith_number":"pith:J4TF2VFN","schema_version":"1.0","canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","source":{"kind":"arxiv","id":"2402.09638","version":1},"attestation_state":"computed","paper":{"title":"Multi-Fidelity Methods for Optimization: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Fan Li, Ke Li","submitted_at":"2024-02-15T00:52:34Z","abstract_excerpt":"Real-world black-box optimization often involves time-consuming or costly experiments and simulations. Multi-fidelity optimization (MFO) stands out as a cost-effective strategy that balances high-fidelity accuracy with computational efficiency through a hierarchical fidelity approach. This survey presents a systematic exploration of MFO, underpinned by a novel text mining framework based on a pre-trained language model. We delve deep into the foundational principles and methodologies of MFO, focusing on three core components -- multi-fidelity surrogate models, fidelity management strategies, a"},"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":"2402.09638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-15T00:52:34Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"576d2cb815010fbb37a3ed39f65697972c6f5a57b90f3dbede6b9cc64d8a0780","abstract_canon_sha256":"b7b928746758a8f62fc0b6adf4e693777751c844685b65820c115d95cdd575b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:19.586634Z","signature_b64":"s4QJ9cYbRjY8bCqD2fZPqjb3uW8lnNWNDEdQnnr/dVvTPicgx2+P8g7Un+nWIi5jljE++C+h3ynm2hpH7htvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","last_reissued_at":"2026-07-05T07:45:19.586165Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:19.586165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Fidelity Methods for Optimization: A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.LG","authors_text":"Fan Li, Ke Li","submitted_at":"2024-02-15T00:52:34Z","abstract_excerpt":"Real-world black-box optimization often involves time-consuming or costly experiments and simulations. Multi-fidelity optimization (MFO) stands out as a cost-effective strategy that balances high-fidelity accuracy with computational efficiency through a hierarchical fidelity approach. This survey presents a systematic exploration of MFO, underpinned by a novel text mining framework based on a pre-trained language model. We delve deep into the foundational principles and methodologies of MFO, focusing on three core components -- multi-fidelity surrogate models, fidelity management strategies, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09638","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/2402.09638/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":"2402.09638","created_at":"2026-07-05T07:45:19.586221+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09638v1","created_at":"2026-07-05T07:45:19.586221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09638","created_at":"2026-07-05T07:45:19.586221+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4TF2VFN4ISX","created_at":"2026-07-05T07:45:19.586221+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4TF2VFN4ISXMVAK","created_at":"2026-07-05T07:45:19.586221+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4TF2VFN","created_at":"2026-07-05T07:45:19.586221+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00865","citing_title":"Constrained Bayesian Optimisation with Multiple Information Sources","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04051","citing_title":"A Consistency-Centric Approach to Set-Based Optimization with Multiple Models of Unranked Fidelity","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF","json":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF.json","graph_json":"https://pith.science/api/pith-number/J4TF2VFN4ISXMVAKWPB2XCIMPF/graph.json","events_json":"https://pith.science/api/pith-number/J4TF2VFN4ISXMVAKWPB2XCIMPF/events.json","paper":"https://pith.science/paper/J4TF2VFN"},"agent_actions":{"view_html":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF","download_json":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF.json","view_paper":"https://pith.science/paper/J4TF2VFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09638&json=true","fetch_graph":"https://pith.science/api/pith-number/J4TF2VFN4ISXMVAKWPB2XCIMPF/graph.json","fetch_events":"https://pith.science/api/pith-number/J4TF2VFN4ISXMVAKWPB2XCIMPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/action/storage_attestation","attest_author":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/action/author_attestation","sign_citation":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/action/citation_signature","submit_replication":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/action/replication_record"}},"created_at":"2026-07-05T07:45:19.586221+00:00","updated_at":"2026-07-05T07:45:19.586221+00:00"}