{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GI7NVIPZXMDZYKAA22AWOLTVU2","short_pith_number":"pith:GI7NVIPZ","schema_version":"1.0","canonical_sha256":"323edaa1f9bb079c2800d681672e75a699806fc72e0d3c7d9368f6b6921abca6","source":{"kind":"arxiv","id":"1310.2008","version":2},"attestation_state":"computed","paper":{"title":"Fast updating algorithms for latent semantic indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eugene Vecharynski, Yousef Saad","submitted_at":"2013-10-08T05:33:40Z","abstract_excerpt":"This paper discusses a few algorithms for updating the approximate Singular Value Decomposition (SVD) in the context of information retrieval by Latent Semantic Indexing (LSI) methods. A unifying framework is considered which is based on Rayleigh-Ritz projection methods. First, a Rayleigh-Ritz approach for the SVD is discussed and it is then used to interpret the Zha--Simon algorithms [SIAM J. Scient. Comput. vol. 21 (1999), pp. 782-791]. This viewpoint leads to a few alternatives whose goal is to reduce computational cost and storage requirement by projection techniques that utilize subspaces"},"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":"1310.2008","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-08T05:33:40Z","cross_cats_sorted":[],"title_canon_sha256":"198a9f3ac534b04955af8c8a6d59fa4bd257fbc908f9156271271e4c6729aaab","abstract_canon_sha256":"77f08b45dba4d1c3a5e78139b24349fbb302ac25248b48319b9e1e8ba44b752a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.137919Z","signature_b64":"GYhpgO5M+xxRXHEwjztAmmbhyGqUeXw1/xwB3hBU2x/ohyP/QXytRTLxGhRYHW0F+1idWzT/sLlvlVV+hhmGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"323edaa1f9bb079c2800d681672e75a699806fc72e0d3c7d9368f6b6921abca6","last_reissued_at":"2026-05-18T02:52:04.137464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.137464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast updating algorithms for latent semantic indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Eugene Vecharynski, Yousef Saad","submitted_at":"2013-10-08T05:33:40Z","abstract_excerpt":"This paper discusses a few algorithms for updating the approximate Singular Value Decomposition (SVD) in the context of information retrieval by Latent Semantic Indexing (LSI) methods. A unifying framework is considered which is based on Rayleigh-Ritz projection methods. First, a Rayleigh-Ritz approach for the SVD is discussed and it is then used to interpret the Zha--Simon algorithms [SIAM J. Scient. Comput. vol. 21 (1999), pp. 782-791]. This viewpoint leads to a few alternatives whose goal is to reduce computational cost and storage requirement by projection techniques that utilize subspaces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2008","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":"1310.2008","created_at":"2026-05-18T02:52:04.137536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2008v2","created_at":"2026-05-18T02:52:04.137536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2008","created_at":"2026-05-18T02:52:04.137536+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI7NVIPZXMDZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI7NVIPZXMDZYKAA","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI7NVIPZ","created_at":"2026-05-18T12:27:45.050594+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/GI7NVIPZXMDZYKAA22AWOLTVU2","json":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2.json","graph_json":"https://pith.science/api/pith-number/GI7NVIPZXMDZYKAA22AWOLTVU2/graph.json","events_json":"https://pith.science/api/pith-number/GI7NVIPZXMDZYKAA22AWOLTVU2/events.json","paper":"https://pith.science/paper/GI7NVIPZ"},"agent_actions":{"view_html":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2","download_json":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2.json","view_paper":"https://pith.science/paper/GI7NVIPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2008&json=true","fetch_graph":"https://pith.science/api/pith-number/GI7NVIPZXMDZYKAA22AWOLTVU2/graph.json","fetch_events":"https://pith.science/api/pith-number/GI7NVIPZXMDZYKAA22AWOLTVU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2/action/storage_attestation","attest_author":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2/action/author_attestation","sign_citation":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2/action/citation_signature","submit_replication":"https://pith.science/pith/GI7NVIPZXMDZYKAA22AWOLTVU2/action/replication_record"}},"created_at":"2026-05-18T02:52:04.137536+00:00","updated_at":"2026-05-18T02:52:04.137536+00:00"}