{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:S3M4TPRLDPYV5NEM7BFNRC6D2N","short_pith_number":"pith:S3M4TPRL","schema_version":"1.0","canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","source":{"kind":"arxiv","id":"2509.02840","version":1},"attestation_state":"computed","paper":{"title":"Fast and Accurate SVD-Type Updating in Streaming Data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Johannes J. Brust, Michael A. Saunders","submitted_at":"2025-09-02T21:17:37Z","abstract_excerpt":"For a datastream, the change over a short interval is often of low rank. For high throughput information arranged in matrix format, recomputing an optimal SVD approximation after each step is typically prohibitive. Instead, incremental and truncated updating strategies are used, which may not scale for large truncation ranks. Therefore, we propose a set of efficient new algorithms that update a bidiagonal factorization, and which are similarly accurate as the SVD methods. In particular, we develop a compact Householder-type algorithm that decouples a sparse part from a low-rank update and has "},"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":"2509.02840","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-02T21:17:37Z","cross_cats_sorted":["cs.LG","cs.MS","cs.NA"],"title_canon_sha256":"15830cb46c9a99b501b495f542640a8fa1635721d340b47509c3f926d417af54","abstract_canon_sha256":"70ab69ba8896df4d1bee27888bde9b118e56d7eca711353d90ee9e3474b05f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:58.370533Z","signature_b64":"9699heOD8bSB0WwsFSini1dNBiuwF+2O3WRdjmNztqyFG6QC2Tg4J9OHWPX+4NA+7sBu4T6ZFWl8uC8CdqfwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","last_reissued_at":"2026-07-05T12:03:58.370096Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:58.370096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Accurate SVD-Type Updating in Streaming Data","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.LG","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Johannes J. Brust, Michael A. Saunders","submitted_at":"2025-09-02T21:17:37Z","abstract_excerpt":"For a datastream, the change over a short interval is often of low rank. For high throughput information arranged in matrix format, recomputing an optimal SVD approximation after each step is typically prohibitive. Instead, incremental and truncated updating strategies are used, which may not scale for large truncation ranks. Therefore, we propose a set of efficient new algorithms that update a bidiagonal factorization, and which are similarly accurate as the SVD methods. In particular, we develop a compact Householder-type algorithm that decouples a sparse part from a low-rank update and has "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02840","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/2509.02840/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":"2509.02840","created_at":"2026-07-05T12:03:58.370151+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.02840v1","created_at":"2026-07-05T12:03:58.370151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02840","created_at":"2026-07-05T12:03:58.370151+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3M4TPRLDPYV","created_at":"2026-07-05T12:03:58.370151+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3M4TPRLDPYV5NEM","created_at":"2026-07-05T12:03:58.370151+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3M4TPRL","created_at":"2026-07-05T12:03:58.370151+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.24514","citing_title":"Incremental SVD for Large-Scale Dynamic Matrices: Accuracy, Subspace Stability, Refresh Strategies, and Financial Factor-Based Risk Models","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N","json":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N.json","graph_json":"https://pith.science/api/pith-number/S3M4TPRLDPYV5NEM7BFNRC6D2N/graph.json","events_json":"https://pith.science/api/pith-number/S3M4TPRLDPYV5NEM7BFNRC6D2N/events.json","paper":"https://pith.science/paper/S3M4TPRL"},"agent_actions":{"view_html":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N","download_json":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N.json","view_paper":"https://pith.science/paper/S3M4TPRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.02840&json=true","fetch_graph":"https://pith.science/api/pith-number/S3M4TPRLDPYV5NEM7BFNRC6D2N/graph.json","fetch_events":"https://pith.science/api/pith-number/S3M4TPRLDPYV5NEM7BFNRC6D2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/action/storage_attestation","attest_author":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/action/author_attestation","sign_citation":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/action/citation_signature","submit_replication":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/action/replication_record"}},"created_at":"2026-07-05T12:03:58.370151+00:00","updated_at":"2026-07-05T12:03:58.370151+00:00"}