{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SKQBHXROELN2C42MDOSW7RYY5E","short_pith_number":"pith:SKQBHXRO","schema_version":"1.0","canonical_sha256":"92a013de2e22dba1734c1ba56fc718e9193df75a832fee2afb20c84c775fcaa5","source":{"kind":"arxiv","id":"1803.06313","version":1},"attestation_state":"computed","paper":{"title":"Error Analysis of an Incremental POD Algorithm for PDE Simulation Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hiba Fareed, John R. Singler","submitted_at":"2018-03-16T17:02:36Z","abstract_excerpt":"In our earlier work [Fareed et al., Comput. Math. Appl. 75 (2018), no. 6, 1942-1960], we proposed an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD) of a set of simulation data for a partial differential equation (PDE) without storing the data. In this work, we perform an error analysis of the incremental SVD algorithm. We also modify the algorithm to incrementally update both the SVD and an error bound when a new column of data is added. We show the algorithm produces the exact SVD of an approximate data matrix, and the o"},"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":"1803.06313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2018-03-16T17:02:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bc1958d0f18fadf3c3dae28a20820df9c216380606c9409c62e1cb7deaf67d2f","abstract_canon_sha256":"94e9a3eab94cb6ddf1bfb9ea9ce17c57883d0127ed23fb4f3202907aa902232f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T19:11:41.733502Z","signature_b64":"TZMtSDLbsoaUenp2OTPlCDmjYhQfsX6IFy+xzYpnx2JoZzevFFaqDnbss9soQYRgrrpW4eHlpr2J9lP8+PHQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92a013de2e22dba1734c1ba56fc718e9193df75a832fee2afb20c84c775fcaa5","last_reissued_at":"2026-06-04T19:11:41.733029Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T19:11:41.733029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Error Analysis of an Incremental POD Algorithm for PDE Simulation Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Hiba Fareed, John R. Singler","submitted_at":"2018-03-16T17:02:36Z","abstract_excerpt":"In our earlier work [Fareed et al., Comput. Math. Appl. 75 (2018), no. 6, 1942-1960], we proposed an incremental SVD algorithm with respect to a weighted inner product to compute the proper orthogonal decomposition (POD) of a set of simulation data for a partial differential equation (PDE) without storing the data. In this work, we perform an error analysis of the incremental SVD algorithm. We also modify the algorithm to incrementally update both the SVD and an error bound when a new column of data is added. We show the algorithm produces the exact SVD of an approximate data matrix, and the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06313","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/1803.06313/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":"1803.06313","created_at":"2026-06-04T19:11:41.733085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06313v1","created_at":"2026-06-04T19:11:41.733085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06313","created_at":"2026-06-04T19:11:41.733085+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKQBHXROELN2","created_at":"2026-06-04T19:11:41.733085+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKQBHXROELN2C42M","created_at":"2026-06-04T19:11:41.733085+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKQBHXRO","created_at":"2026-06-04T19:11:41.733085+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/SKQBHXROELN2C42MDOSW7RYY5E","json":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E.json","graph_json":"https://pith.science/api/pith-number/SKQBHXROELN2C42MDOSW7RYY5E/graph.json","events_json":"https://pith.science/api/pith-number/SKQBHXROELN2C42MDOSW7RYY5E/events.json","paper":"https://pith.science/paper/SKQBHXRO"},"agent_actions":{"view_html":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E","download_json":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E.json","view_paper":"https://pith.science/paper/SKQBHXRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06313&json=true","fetch_graph":"https://pith.science/api/pith-number/SKQBHXROELN2C42MDOSW7RYY5E/graph.json","fetch_events":"https://pith.science/api/pith-number/SKQBHXROELN2C42MDOSW7RYY5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E/action/storage_attestation","attest_author":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E/action/author_attestation","sign_citation":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E/action/citation_signature","submit_replication":"https://pith.science/pith/SKQBHXROELN2C42MDOSW7RYY5E/action/replication_record"}},"created_at":"2026-06-04T19:11:41.733085+00:00","updated_at":"2026-06-04T19:11:41.733085+00:00"}