{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CIULPY4TGYC6ZHDCJ3YDT4ED4N","short_pith_number":"pith:CIULPY4T","schema_version":"1.0","canonical_sha256":"1228b7e3933605ec9c624ef039f083e370163bee315e949297615f115c0d1822","source":{"kind":"arxiv","id":"2503.21252","version":1},"attestation_state":"computed","paper":{"title":"Multi-fidelity Learning of Reduced Order Models for Parabolic PDE Constrained Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Benedikt Klein, Mario Ohlberger","submitted_at":"2025-03-27T08:18:00Z","abstract_excerpt":"This article builds on the recently proposed RB-ML-ROM approach for parameterized parabolic PDEs and proposes a novel hierarchical Trust Region algorithm for solving parabolic PDE constrained optimization problems. Instead of using a traditional offline/online splitting approach for model order reduction, we adopt an active learning or enrichment strategy to construct a multi-fidelity hierarchy of reduced order models on-the-fly during the outer optimization loop. The multi-fidelity surrogate model consists of a full order model, a reduced order model and a machine learning model. The proposed"},"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.21252","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-03-27T08:18:00Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"cf19641f3234e6acb3bdb7e64bcb839c1c33749da199bf3c83e4ea242d3155ea","abstract_canon_sha256":"0fbd2c627228ccabd1e53167813d484bf6b0e0e8dd8c1f43da3fbd06f0624a6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:40:22.087204Z","signature_b64":"Cnmpc2cgPn4TW5LdgIAFNSURDw1DdNBX7dfPFEG6ihmMmSu0yCp1kEzIC0EITQ82g/SN2QSh9lIKYX4j9PizBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1228b7e3933605ec9c624ef039f083e370163bee315e949297615f115c0d1822","last_reissued_at":"2026-07-05T10:40:22.086779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:40:22.086779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-fidelity Learning of Reduced Order Models for Parabolic PDE Constrained Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Benedikt Klein, Mario Ohlberger","submitted_at":"2025-03-27T08:18:00Z","abstract_excerpt":"This article builds on the recently proposed RB-ML-ROM approach for parameterized parabolic PDEs and proposes a novel hierarchical Trust Region algorithm for solving parabolic PDE constrained optimization problems. Instead of using a traditional offline/online splitting approach for model order reduction, we adopt an active learning or enrichment strategy to construct a multi-fidelity hierarchy of reduced order models on-the-fly during the outer optimization loop. The multi-fidelity surrogate model consists of a full order model, a reduced order model and a machine learning model. The proposed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.21252","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/2503.21252/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.21252","created_at":"2026-07-05T10:40:22.086833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.21252v1","created_at":"2026-07-05T10:40:22.086833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.21252","created_at":"2026-07-05T10:40:22.086833+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIULPY4TGYC6","created_at":"2026-07-05T10:40:22.086833+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIULPY4TGYC6ZHDC","created_at":"2026-07-05T10:40:22.086833+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIULPY4T","created_at":"2026-07-05T10:40:22.086833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.11130","citing_title":"Adaptive Reduced Basis Trust Region Methods for Parabolic Inverse Problems","ref_index":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N","json":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N.json","graph_json":"https://pith.science/api/pith-number/CIULPY4TGYC6ZHDCJ3YDT4ED4N/graph.json","events_json":"https://pith.science/api/pith-number/CIULPY4TGYC6ZHDCJ3YDT4ED4N/events.json","paper":"https://pith.science/paper/CIULPY4T"},"agent_actions":{"view_html":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N","download_json":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N.json","view_paper":"https://pith.science/paper/CIULPY4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.21252&json=true","fetch_graph":"https://pith.science/api/pith-number/CIULPY4TGYC6ZHDCJ3YDT4ED4N/graph.json","fetch_events":"https://pith.science/api/pith-number/CIULPY4TGYC6ZHDCJ3YDT4ED4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N/action/storage_attestation","attest_author":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N/action/author_attestation","sign_citation":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N/action/citation_signature","submit_replication":"https://pith.science/pith/CIULPY4TGYC6ZHDCJ3YDT4ED4N/action/replication_record"}},"created_at":"2026-07-05T10:40:22.086833+00:00","updated_at":"2026-07-05T10:40:22.086833+00:00"}