{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AYKNKINXPPPYSFK5AKL7UWKOPK","short_pith_number":"pith:AYKNKINX","schema_version":"1.0","canonical_sha256":"0614d521b77bdf89155d0297fa594e7a8ef79f05f24bf238999066523bc2b6c6","source":{"kind":"arxiv","id":"1209.5455","version":2},"attestation_state":"computed","paper":{"title":"Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bart van Bloemen Waanders, Jaideep Ray, Kevin Carlberg","submitted_at":"2012-09-24T23:39:13Z","abstract_excerpt":"Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's t"},"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":"1209.5455","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T23:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"c25c5b81d90a72f383ab4db37d68409de7a6fc2964efa6c5e8423ec9d388f049","abstract_canon_sha256":"8b30d746a3a95580ad558ccee9873c999f23ac6dba5a46d8cef4dd7844fff009"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.354674Z","signature_b64":"fA2ojE40UzmcVL6bH0ojHjIno89MZcGs79NhfXp1BMuSPjde6bwI+w8O3iZX+70EuyK3QeUz8y8ePt/0D6AoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0614d521b77bdf89155d0297fa594e7a8ef79f05f24bf238999066523bc2b6c6","last_reissued_at":"2026-05-18T02:39:32.354201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.354201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bart van Bloemen Waanders, Jaideep Ray, Kevin Carlberg","submitted_at":"2012-09-24T23:39:13Z","abstract_excerpt":"Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5455","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":""},"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":"1209.5455","created_at":"2026-05-18T02:39:32.354270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5455v2","created_at":"2026-05-18T02:39:32.354270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5455","created_at":"2026-05-18T02:39:32.354270+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYKNKINXPPPY","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYKNKINXPPPYSFK5","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYKNKINX","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK","json":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK.json","graph_json":"https://pith.science/api/pith-number/AYKNKINXPPPYSFK5AKL7UWKOPK/graph.json","events_json":"https://pith.science/api/pith-number/AYKNKINXPPPYSFK5AKL7UWKOPK/events.json","paper":"https://pith.science/paper/AYKNKINX"},"agent_actions":{"view_html":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK","download_json":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK.json","view_paper":"https://pith.science/paper/AYKNKINX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5455&json=true","fetch_graph":"https://pith.science/api/pith-number/AYKNKINXPPPYSFK5AKL7UWKOPK/graph.json","fetch_events":"https://pith.science/api/pith-number/AYKNKINXPPPYSFK5AKL7UWKOPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK/action/storage_attestation","attest_author":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK/action/author_attestation","sign_citation":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK/action/citation_signature","submit_replication":"https://pith.science/pith/AYKNKINXPPPYSFK5AKL7UWKOPK/action/replication_record"}},"created_at":"2026-05-18T02:39:32.354270+00:00","updated_at":"2026-05-18T02:39:32.354270+00:00"}