{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2N6IOTMRMZNT73NTEIVWUX7CYM","short_pith_number":"pith:2N6IOTMR","schema_version":"1.0","canonical_sha256":"d37c874d91665b3fedb3222b6a5fe2c3246fff2758e942144e6e3f6fbf97f7fc","source":{"kind":"arxiv","id":"1307.5494","version":1},"attestation_state":"computed","paper":{"title":"On GROUSE and Incremental SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Laura Balzano, Stephen J. Wright","submitted_at":"2013-07-21T03:47:16Z","abstract_excerpt":"GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an incremental algorithm for identifying a subspace of Rn from a sequence of vectors in this subspace, where only a subset of components of each vector is revealed at each iteration. Recent analysis has shown that GROUSE converges locally at an expected linear rate, under certain assumptions. GROUSE has a similar flavor to the incremental singular value decomposition algorithm, which updates the SVD of a matrix following addition of a single column. In this paper, we modify the incremental SVD approach to handle missing data, and dem"},"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":"1307.5494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2013-07-21T03:47:16Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9620d1bc341247a2104e3a15162da8db9e105e2179c14bb18d64e24b9ff17ecc","abstract_canon_sha256":"5796247fd6761909fedaf7e7f6a492e87e8075b456eb81243142c7f2ea292a05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:55.533241Z","signature_b64":"+GcR58xSDqCTbutldX0LFVMU8nOyg33KdOMpWyAEFABGL3YcqoEIICDhCN2PL4R+bLiswgB0uKiQ4edQd9rDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d37c874d91665b3fedb3222b6a5fe2c3246fff2758e942144e6e3f6fbf97f7fc","last_reissued_at":"2026-05-18T03:17:55.532401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:55.532401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On GROUSE and Incremental SVD","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.NA","authors_text":"Laura Balzano, Stephen J. Wright","submitted_at":"2013-07-21T03:47:16Z","abstract_excerpt":"GROUSE (Grassmannian Rank-One Update Subspace Estimation) is an incremental algorithm for identifying a subspace of Rn from a sequence of vectors in this subspace, where only a subset of components of each vector is revealed at each iteration. Recent analysis has shown that GROUSE converges locally at an expected linear rate, under certain assumptions. GROUSE has a similar flavor to the incremental singular value decomposition algorithm, which updates the SVD of a matrix following addition of a single column. In this paper, we modify the incremental SVD approach to handle missing data, and dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.5494","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":""},"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":"1307.5494","created_at":"2026-05-18T03:17:55.532607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.5494v1","created_at":"2026-05-18T03:17:55.532607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.5494","created_at":"2026-05-18T03:17:55.532607+00:00"},{"alias_kind":"pith_short_12","alias_value":"2N6IOTMRMZNT","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2N6IOTMRMZNT73NT","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2N6IOTMR","created_at":"2026-05-18T12:27:32.513160+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/2N6IOTMRMZNT73NTEIVWUX7CYM","json":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM.json","graph_json":"https://pith.science/api/pith-number/2N6IOTMRMZNT73NTEIVWUX7CYM/graph.json","events_json":"https://pith.science/api/pith-number/2N6IOTMRMZNT73NTEIVWUX7CYM/events.json","paper":"https://pith.science/paper/2N6IOTMR"},"agent_actions":{"view_html":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM","download_json":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM.json","view_paper":"https://pith.science/paper/2N6IOTMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.5494&json=true","fetch_graph":"https://pith.science/api/pith-number/2N6IOTMRMZNT73NTEIVWUX7CYM/graph.json","fetch_events":"https://pith.science/api/pith-number/2N6IOTMRMZNT73NTEIVWUX7CYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM/action/storage_attestation","attest_author":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM/action/author_attestation","sign_citation":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM/action/citation_signature","submit_replication":"https://pith.science/pith/2N6IOTMRMZNT73NTEIVWUX7CYM/action/replication_record"}},"created_at":"2026-05-18T03:17:55.532607+00:00","updated_at":"2026-05-18T03:17:55.532607+00:00"}