{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5GLKVH2VFIVGF2PYQV737ZJ2OY","short_pith_number":"pith:5GLKVH2V","schema_version":"1.0","canonical_sha256":"e996aa9f552a2a62e9f8857fbfe53a763ac5fff666a8a769b958498f16a04b98","source":{"kind":"arxiv","id":"1705.07654","version":1},"attestation_state":"computed","paper":{"title":"ReFACTor: Practical Low-Rank Matrix Estimation Under Column-Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elior Rahmani, Eran Halperin, Matan Gavish, Regev Schweiger","submitted_at":"2017-05-22T10:43:09Z","abstract_excerpt":"Various problems in data analysis and statistical genetics call for recovery of a column-sparse, low-rank matrix from noisy observations. We propose ReFACTor, a simple variation of the classical Truncated Singular Value Decomposition (TSVD) algorithm. In contrast to previous sparse principal component analysis (PCA) algorithms, our algorithm can provably reveal a low-rank signal matrix better, and often significantly better, than the widely used TSVD, making it the algorithm of choice whenever column-sparsity is suspected. Empirically, we observe that ReFACTor consistently outperforms TSVD eve"},"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":"1705.07654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T10:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"ebdcc94643db34b31f825fe7d2eeebf9a30ff1e5027334c99b86aca2e215f032","abstract_canon_sha256":"49cf65da2a2a4d1ca55d6ca6eabfe224037353a210604d14dda71865b71ccdb1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:04.941399Z","signature_b64":"mGDX59MEu+YGbLWC1jFPanuwR5kADpT0MxebClKQC5McZP9dCoCzkoNjnxot47QC43MLrRmiZnDRJRm/xR+wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e996aa9f552a2a62e9f8857fbfe53a763ac5fff666a8a769b958498f16a04b98","last_reissued_at":"2026-05-18T00:44:04.940960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:04.940960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ReFACTor: Practical Low-Rank Matrix Estimation Under Column-Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Elior Rahmani, Eran Halperin, Matan Gavish, Regev Schweiger","submitted_at":"2017-05-22T10:43:09Z","abstract_excerpt":"Various problems in data analysis and statistical genetics call for recovery of a column-sparse, low-rank matrix from noisy observations. We propose ReFACTor, a simple variation of the classical Truncated Singular Value Decomposition (TSVD) algorithm. In contrast to previous sparse principal component analysis (PCA) algorithms, our algorithm can provably reveal a low-rank signal matrix better, and often significantly better, than the widely used TSVD, making it the algorithm of choice whenever column-sparsity is suspected. Empirically, we observe that ReFACTor consistently outperforms TSVD eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07654","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":"1705.07654","created_at":"2026-05-18T00:44:04.941018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07654v1","created_at":"2026-05-18T00:44:04.941018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07654","created_at":"2026-05-18T00:44:04.941018+00:00"},{"alias_kind":"pith_short_12","alias_value":"5GLKVH2VFIVG","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5GLKVH2VFIVGF2PY","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5GLKVH2V","created_at":"2026-05-18T12:31:00.734936+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/5GLKVH2VFIVGF2PYQV737ZJ2OY","json":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY.json","graph_json":"https://pith.science/api/pith-number/5GLKVH2VFIVGF2PYQV737ZJ2OY/graph.json","events_json":"https://pith.science/api/pith-number/5GLKVH2VFIVGF2PYQV737ZJ2OY/events.json","paper":"https://pith.science/paper/5GLKVH2V"},"agent_actions":{"view_html":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY","download_json":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY.json","view_paper":"https://pith.science/paper/5GLKVH2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07654&json=true","fetch_graph":"https://pith.science/api/pith-number/5GLKVH2VFIVGF2PYQV737ZJ2OY/graph.json","fetch_events":"https://pith.science/api/pith-number/5GLKVH2VFIVGF2PYQV737ZJ2OY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY/action/storage_attestation","attest_author":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY/action/author_attestation","sign_citation":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY/action/citation_signature","submit_replication":"https://pith.science/pith/5GLKVH2VFIVGF2PYQV737ZJ2OY/action/replication_record"}},"created_at":"2026-05-18T00:44:04.941018+00:00","updated_at":"2026-05-18T00:44:04.941018+00:00"}