{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CM344RCXMWK4R7RSBGX2LCRFGV","short_pith_number":"pith:CM344RCX","schema_version":"1.0","canonical_sha256":"1337ce44576595c8fe3209afa58a25357702914438cee8fef90b3771c206e098","source":{"kind":"arxiv","id":"2401.09703","version":1},"attestation_state":"computed","paper":{"title":"Fast Updating Truncated SVD for Representation Learning with Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Cheng Chen, Haoran Deng, Jiahe Li, Shiliang Pu, Weihao Jiang, Yang Yang","submitted_at":"2024-01-18T03:21:36Z","abstract_excerpt":"Updating a truncated Singular Value Decomposition (SVD) is crucial in representation learning, especially when dealing with large-scale data matrices that continuously evolve in practical scenarios. Aligning SVD-based models with fast-paced updates becomes increasingly important. Existing methods for updating truncated SVDs employ Rayleigh-Ritz projection procedures, where projection matrices are augmented based on original singular vectors. However, these methods suffer from inefficiency due to the densification of the update matrix and the application of the projection to all singular vector"},"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.09703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-01-18T03:21:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"c41d6ed0e20f606353a7eb9fc13efd1f9bd69bec1b055ecbbfef376f3d4c6117","abstract_canon_sha256":"d39de3af611dee8b44d82625f13e02786c4cc457d3e6cbd5fd564495ade63357"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:01.040644Z","signature_b64":"uqyY0rlGMH+PnfZBPj8C07n7PMAvhmpS+vqZ5nzObhCQwx2mxIqrr3BznGIFPKXV4CZKDiGI+DUJTHGR8Lh3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1337ce44576595c8fe3209afa58a25357702914438cee8fef90b3771c206e098","last_reissued_at":"2026-07-05T07:35:01.040233Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:01.040233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Updating Truncated SVD for Representation Learning with Sparse Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Cheng Chen, Haoran Deng, Jiahe Li, Shiliang Pu, Weihao Jiang, Yang Yang","submitted_at":"2024-01-18T03:21:36Z","abstract_excerpt":"Updating a truncated Singular Value Decomposition (SVD) is crucial in representation learning, especially when dealing with large-scale data matrices that continuously evolve in practical scenarios. Aligning SVD-based models with fast-paced updates becomes increasingly important. Existing methods for updating truncated SVDs employ Rayleigh-Ritz projection procedures, where projection matrices are augmented based on original singular vectors. However, these methods suffer from inefficiency due to the densification of the update matrix and the application of the projection to all singular vector"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09703","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/2401.09703/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.09703","created_at":"2026-07-05T07:35:01.040293+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09703v1","created_at":"2026-07-05T07:35:01.040293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09703","created_at":"2026-07-05T07:35:01.040293+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM344RCXMWK4","created_at":"2026-07-05T07:35:01.040293+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM344RCXMWK4R7RS","created_at":"2026-07-05T07:35:01.040293+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM344RCX","created_at":"2026-07-05T07:35:01.040293+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21382","citing_title":"DeCAF: Decentralized Consensus-And-Factorization for Low-Rank Adaptation of Foundation Models","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV","json":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV.json","graph_json":"https://pith.science/api/pith-number/CM344RCXMWK4R7RSBGX2LCRFGV/graph.json","events_json":"https://pith.science/api/pith-number/CM344RCXMWK4R7RSBGX2LCRFGV/events.json","paper":"https://pith.science/paper/CM344RCX"},"agent_actions":{"view_html":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV","download_json":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV.json","view_paper":"https://pith.science/paper/CM344RCX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09703&json=true","fetch_graph":"https://pith.science/api/pith-number/CM344RCXMWK4R7RSBGX2LCRFGV/graph.json","fetch_events":"https://pith.science/api/pith-number/CM344RCXMWK4R7RSBGX2LCRFGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV/action/storage_attestation","attest_author":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV/action/author_attestation","sign_citation":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV/action/citation_signature","submit_replication":"https://pith.science/pith/CM344RCXMWK4R7RSBGX2LCRFGV/action/replication_record"}},"created_at":"2026-07-05T07:35:01.040293+00:00","updated_at":"2026-07-05T07:35:01.040293+00:00"}