{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:J4TF2VFN4ISXMVAKWPB2XCIMPF","short_pith_number":"pith:J4TF2VFN","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"},"canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","source":{"kind":"arxiv","id":"2402.09638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09638","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09638v1","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09638","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"J4TF2VFN4ISX","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_16","alias_value":"J4TF2VFN4ISXMVAK","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_8","alias_value":"J4TF2VFN","created_at":"2026-07-05T07:45:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:J4TF2VFN4ISXMVAKWPB2XCIMPF","target":"record","payload":{"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"},"canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","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"},"source_kind":"arxiv","source_id":"2402.09638","source_version":1,"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-05T07:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjFUyxbfVqb4GHFtVC3CvzN+aIwCSLAbldsJliEX2+PBlN0ArPgB5g5bbJruuKy0OLfcQ+4KEVDxC6SEyBowBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:20:45.461406Z"},"content_sha256":"6b34b999b951ff7cc3309f657fd761f62bc9146f1807397f8963c5341d0d2a8e","schema_version":"1.0","event_id":"sha256:6b34b999b951ff7cc3309f657fd761f62bc9146f1807397f8963c5341d0d2a8e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:J4TF2VFN4ISXMVAKWPB2XCIMPF","target":"graph","payload":{"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"},"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-05T07:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8bUEIzAtxsDo4++0m5kR+raSSqfzbIbZKwgRH9kII3BQkXFVfkiInTdjI6HmpeDQaxSzb9+THkvrA2il+d9iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T00:20:45.461932Z"},"content_sha256":"72a4e393b3c0d566c614678b08df3d76c8f3679154e3a4520930895488036ba0","schema_version":"1.0","event_id":"sha256:72a4e393b3c0d566c614678b08df3d76c8f3679154e3a4520930895488036ba0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/bundle.json","state_url":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/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-08-03T00:20:45Z","links":{"resolver":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF","bundle":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/bundle.json","state":"https://pith.science/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4TF2VFN4ISXMVAKWPB2XCIMPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:J4TF2VFN4ISXMVAKWPB2XCIMPF","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":"b7b928746758a8f62fc0b6adf4e693777751c844685b65820c115d95cdd575b9","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-15T00:52:34Z","title_canon_sha256":"576d2cb815010fbb37a3ed39f65697972c6f5a57b90f3dbede6b9cc64d8a0780"},"schema_version":"1.0","source":{"id":"2402.09638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09638","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09638v1","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09638","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"J4TF2VFN4ISX","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_16","alias_value":"J4TF2VFN4ISXMVAK","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_8","alias_value":"J4TF2VFN","created_at":"2026-07-05T07:45:19Z"}],"graph_snapshots":[{"event_id":"sha256:72a4e393b3c0d566c614678b08df3d76c8f3679154e3a4520930895488036ba0","target":"graph","created_at":"2026-07-05T07:45:19Z","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/2402.09638/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fan Li, Ke Li","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-15T00:52:34Z","title":"Multi-Fidelity Methods for Optimization: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09638","kind":"arxiv","version":1},"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:6b34b999b951ff7cc3309f657fd761f62bc9146f1807397f8963c5341d0d2a8e","target":"record","created_at":"2026-07-05T07:45:19Z","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":"b7b928746758a8f62fc0b6adf4e693777751c844685b65820c115d95cdd575b9","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-15T00:52:34Z","title_canon_sha256":"576d2cb815010fbb37a3ed39f65697972c6f5a57b90f3dbede6b9cc64d8a0780"},"schema_version":"1.0","source":{"id":"2402.09638","kind":"arxiv","version":1}},"canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f265d54ade22576540ab3c3ab890c7964a47fb44312d9c5235d2087d13980a3","first_computed_at":"2026-07-05T07:45:19.586165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:19.586165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s4QJ9cYbRjY8bCqD2fZPqjb3uW8lnNWNDEdQnnr/dVvTPicgx2+P8g7Un+nWIi5jljE++C+h3ynm2hpH7htvCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:19.586634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b34b999b951ff7cc3309f657fd761f62bc9146f1807397f8963c5341d0d2a8e","sha256:72a4e393b3c0d566c614678b08df3d76c8f3679154e3a4520930895488036ba0"],"state_sha256":"ffd8f6107d2e95accb46f6476cb9ab643201cb4e0048b754c372448f6c858be5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L4/A9lr3qeq9kKcBeBa97yAySUb/BhnbyR791oDQMSn0P7xDMKHuVxIJc338xWblwor37UNXbt0gv8gq8aHxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T00:20:45.465770Z","bundle_sha256":"6c0fa6fedbd7431647af3b3371a9968a9f83cd6a78c2393225d800585298e10f"}}