{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:S3M4TPRLDPYV5NEM7BFNRC6D2N","short_pith_number":"pith:S3M4TPRL","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"},"canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","source":{"kind":"arxiv","id":"2509.02840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02840","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02840v1","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02840","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"S3M4TPRLDPYV","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"S3M4TPRLDPYV5NEM","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"S3M4TPRL","created_at":"2026-07-05T12:03:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:S3M4TPRLDPYV5NEM7BFNRC6D2N","target":"record","payload":{"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"},"canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","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"},"source_kind":"arxiv","source_id":"2509.02840","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oW6ClZKZtGyb32+yWXxhylGZgqE75oieY/I6FIZuqIC5m05P4LBPT6AX6DCJRbAH0dFdRGSBLTHcO0d9eEazAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:01:13.210916Z"},"content_sha256":"1f85993cb5fba028aab7cd63f34462ff87bc242d31f5385b537716241736284c","schema_version":"1.0","event_id":"sha256:1f85993cb5fba028aab7cd63f34462ff87bc242d31f5385b537716241736284c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:S3M4TPRLDPYV5NEM7BFNRC6D2N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awpwLOw1OA8/DyuOtel+90Rn3/DHglqMj7GDayt2SKL8bm9mRREcwjrZ3Uf2OqVCVI15n06HqE/yBrNWAH04Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:01:13.211456Z"},"content_sha256":"b67466a8e0852777e4850469c7322d05a317e6d36cb193d482881e29bce11218","schema_version":"1.0","event_id":"sha256:b67466a8e0852777e4850469c7322d05a317e6d36cb193d482881e29bce11218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/bundle.json","state_url":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T22:01:13Z","links":{"resolver":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N","bundle":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/bundle.json","state":"https://pith.science/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3M4TPRLDPYV5NEM7BFNRC6D2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S3M4TPRLDPYV5NEM7BFNRC6D2N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"70ab69ba8896df4d1bee27888bde9b118e56d7eca711353d90ee9e3474b05f13","cross_cats_sorted":["cs.LG","cs.MS","cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-02T21:17:37Z","title_canon_sha256":"15830cb46c9a99b501b495f542640a8fa1635721d340b47509c3f926d417af54"},"schema_version":"1.0","source":{"id":"2509.02840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.02840","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2509.02840v1","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02840","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"S3M4TPRLDPYV","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"S3M4TPRLDPYV5NEM","created_at":"2026-07-05T12:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"S3M4TPRL","created_at":"2026-07-05T12:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:b67466a8e0852777e4850469c7322d05a317e6d36cb193d482881e29bce11218","target":"graph","created_at":"2026-07-05T12:03:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.02840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Johannes J. Brust, Michael A. Saunders","cross_cats":["cs.LG","cs.MS","cs.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-02T21:17:37Z","title":"Fast and Accurate SVD-Type Updating in Streaming Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f85993cb5fba028aab7cd63f34462ff87bc242d31f5385b537716241736284c","target":"record","created_at":"2026-07-05T12:03:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"70ab69ba8896df4d1bee27888bde9b118e56d7eca711353d90ee9e3474b05f13","cross_cats_sorted":["cs.LG","cs.MS","cs.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2025-09-02T21:17:37Z","title_canon_sha256":"15830cb46c9a99b501b495f542640a8fa1635721d340b47509c3f926d417af54"},"schema_version":"1.0","source":{"id":"2509.02840","kind":"arxiv","version":1}},"canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96d9c9be2b1bf15eb48cf84ad88bc3d35ef6748bc96ecee1796b7234382d4911","first_computed_at":"2026-07-05T12:03:58.370096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:58.370096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9699heOD8bSB0WwsFSini1dNBiuwF+2O3WRdjmNztqyFG6QC2Tg4J9OHWPX+4NA+7sBu4T6ZFWl8uC8CdqfwAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:58.370533Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.02840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f85993cb5fba028aab7cd63f34462ff87bc242d31f5385b537716241736284c","sha256:b67466a8e0852777e4850469c7322d05a317e6d36cb193d482881e29bce11218"],"state_sha256":"f45f35446ca76b46c3cfe5a28802d5f5846d0e5835a20d7509c667d469789eb9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuE3Hzw+HsPmuuBA6DgUnPVPL5rDH2EpmkTW+BYZ64lle5KbY4PAxiAcxXDjnZd/UK5JJMA67mnZKZLWVllRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:01:13.216920Z","bundle_sha256":"5905cd9bc8b3d530a5265ec8d01850093c11f472953454045f15715bc7aab053"}}