{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AG333QLJSIFUMVG6VRTCIDE7LG","short_pith_number":"pith:AG333QLJ","schema_version":"1.0","canonical_sha256":"01b7bdc169920b4654deac66240c9f598339f0385d4d4d2d66de65c3d9951b66","source":{"kind":"arxiv","id":"2401.07888","version":2},"attestation_state":"computed","paper":{"title":"Multifidelity domain decomposition-based physics-informed neural networks and operators for time-dependent problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander Heinlein, Amanda A. Howard, Damien Beecroft, Panos Stinis","submitted_at":"2024-01-15T18:32:53Z","abstract_excerpt":"Multiscale problems are challenging for neural network-based discretizations of differential equations, such as physics-informed neural networks (PINNs). This can be (partly) attributed to the so-called spectral bias of neural networks. To improve the performance of PINNs for time-dependent problems, a combination of multifidelity stacking PINNs and domain decomposition-based finite basis PINNs is employed. In particular, to learn the high-fidelity part of the multifidelity model, a domain decomposition in time is employed. The performance is investigated for a pendulum and a two-frequency pro"},"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":"2401.07888","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-01-15T18:32:53Z","cross_cats_sorted":["cs.LG","cs.NA"],"title_canon_sha256":"c53efbd08fed5b0d87549398e3ac04c6664053df261ce6e73a531d895075e253","abstract_canon_sha256":"ea1f234424c548415ce52d934d7adf0ac5c748ccb66e006fa77010ca163d30ec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:04.915643Z","signature_b64":"sNayRPMJXwhl3pi7evz3S0r4I7tAfqDlHXO/TY1oRwxr0XCCjpk8r7pflVgvp5xwWn4w0ajAcEsIR96jpSRbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01b7bdc169920b4654deac66240c9f598339f0385d4d4d2d66de65c3d9951b66","last_reissued_at":"2026-07-05T08:28:04.915199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:04.915199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multifidelity domain decomposition-based physics-informed neural networks and operators for time-dependent problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA"],"primary_cat":"math.NA","authors_text":"Alexander Heinlein, Amanda A. Howard, Damien Beecroft, Panos Stinis","submitted_at":"2024-01-15T18:32:53Z","abstract_excerpt":"Multiscale problems are challenging for neural network-based discretizations of differential equations, such as physics-informed neural networks (PINNs). This can be (partly) attributed to the so-called spectral bias of neural networks. To improve the performance of PINNs for time-dependent problems, a combination of multifidelity stacking PINNs and domain decomposition-based finite basis PINNs is employed. In particular, to learn the high-fidelity part of the multifidelity model, a domain decomposition in time is employed. The performance is investigated for a pendulum and a two-frequency pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.07888","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/2401.07888/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":"2401.07888","created_at":"2026-07-05T08:28:04.915253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.07888v2","created_at":"2026-07-05T08:28:04.915253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.07888","created_at":"2026-07-05T08:28:04.915253+00:00"},{"alias_kind":"pith_short_12","alias_value":"AG333QLJSIFU","created_at":"2026-07-05T08:28:04.915253+00:00"},{"alias_kind":"pith_short_16","alias_value":"AG333QLJSIFUMVG6","created_at":"2026-07-05T08:28:04.915253+00:00"},{"alias_kind":"pith_short_8","alias_value":"AG333QLJ","created_at":"2026-07-05T08:28:04.915253+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.25781","citing_title":"A Practitioner's Guide to Kolmogorov-Arnold Networks","ref_index":223,"is_internal_anchor":false},{"citing_arxiv_id":"2604.23599","citing_title":"Partition-of-Unity Gaussian Kolmogorov-Arnold Networks","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG","json":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG.json","graph_json":"https://pith.science/api/pith-number/AG333QLJSIFUMVG6VRTCIDE7LG/graph.json","events_json":"https://pith.science/api/pith-number/AG333QLJSIFUMVG6VRTCIDE7LG/events.json","paper":"https://pith.science/paper/AG333QLJ"},"agent_actions":{"view_html":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG","download_json":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG.json","view_paper":"https://pith.science/paper/AG333QLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.07888&json=true","fetch_graph":"https://pith.science/api/pith-number/AG333QLJSIFUMVG6VRTCIDE7LG/graph.json","fetch_events":"https://pith.science/api/pith-number/AG333QLJSIFUMVG6VRTCIDE7LG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG/action/storage_attestation","attest_author":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG/action/author_attestation","sign_citation":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG/action/citation_signature","submit_replication":"https://pith.science/pith/AG333QLJSIFUMVG6VRTCIDE7LG/action/replication_record"}},"created_at":"2026-07-05T08:28:04.915253+00:00","updated_at":"2026-07-05T08:28:04.915253+00:00"}