{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5A6PQS5EQHQ56LQEUWX7MNE2R7","short_pith_number":"pith:5A6PQS5E","schema_version":"1.0","canonical_sha256":"e83cf84ba481e1df2e04a5aff6349a8fd39cdcf2fe55f9753e95aba26ece5c7a","source":{"kind":"arxiv","id":"1702.06525","version":3},"attestation_state":"computed","paper":{"title":"A Unified Framework for Low-Rank plus Sparse Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Lingxiao Wang, Quanquan Gu, Xiao Zhang","submitted_at":"2017-02-21T18:56:42Z","abstract_excerpt":"We propose a unified framework to solve general low-rank plus sparse matrix recovery problems based on matrix factorization, which covers a broad family of objective functions satisfying the restricted strong convexity and smoothness conditions. Based on projected gradient descent and the double thresholding operator, our proposed generic algorithm is guaranteed to converge to the unknown low-rank and sparse matrices at a locally linear rate, while matching the best-known robustness guarantee (i.e., tolerance for sparsity). At the core of our theory is a novel structural Lipschitz gradient con"},"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":"1702.06525","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-21T18:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"2c94826e28226a514debf211db1b8817a16252219aad035ef1111b6ec66abf75","abstract_canon_sha256":"edfd82c807deecd915aeb104d57554a5fac5a909902ea437ac0a39c4baaa39b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:59.620884Z","signature_b64":"nlA2fDTdqDvJ06HroAIDuL9mgIC+Os6OFpwSNpU60Folp5YDTMF7PRovkRwuhxnekYF7CYtAm9qekm79bIpYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e83cf84ba481e1df2e04a5aff6349a8fd39cdcf2fe55f9753e95aba26ece5c7a","last_reissued_at":"2026-05-18T00:22:59.620307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:59.620307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Framework for Low-Rank plus Sparse Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Lingxiao Wang, Quanquan Gu, Xiao Zhang","submitted_at":"2017-02-21T18:56:42Z","abstract_excerpt":"We propose a unified framework to solve general low-rank plus sparse matrix recovery problems based on matrix factorization, which covers a broad family of objective functions satisfying the restricted strong convexity and smoothness conditions. Based on projected gradient descent and the double thresholding operator, our proposed generic algorithm is guaranteed to converge to the unknown low-rank and sparse matrices at a locally linear rate, while matching the best-known robustness guarantee (i.e., tolerance for sparsity). At the core of our theory is a novel structural Lipschitz gradient con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06525","kind":"arxiv","version":3},"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":"1702.06525","created_at":"2026-05-18T00:22:59.620416+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06525v3","created_at":"2026-05-18T00:22:59.620416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06525","created_at":"2026-05-18T00:22:59.620416+00:00"},{"alias_kind":"pith_short_12","alias_value":"5A6PQS5EQHQ5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5A6PQS5EQHQ56LQE","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5A6PQS5E","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/5A6PQS5EQHQ56LQEUWX7MNE2R7","json":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7.json","graph_json":"https://pith.science/api/pith-number/5A6PQS5EQHQ56LQEUWX7MNE2R7/graph.json","events_json":"https://pith.science/api/pith-number/5A6PQS5EQHQ56LQEUWX7MNE2R7/events.json","paper":"https://pith.science/paper/5A6PQS5E"},"agent_actions":{"view_html":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7","download_json":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7.json","view_paper":"https://pith.science/paper/5A6PQS5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06525&json=true","fetch_graph":"https://pith.science/api/pith-number/5A6PQS5EQHQ56LQEUWX7MNE2R7/graph.json","fetch_events":"https://pith.science/api/pith-number/5A6PQS5EQHQ56LQEUWX7MNE2R7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7/action/storage_attestation","attest_author":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7/action/author_attestation","sign_citation":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7/action/citation_signature","submit_replication":"https://pith.science/pith/5A6PQS5EQHQ56LQEUWX7MNE2R7/action/replication_record"}},"created_at":"2026-05-18T00:22:59.620416+00:00","updated_at":"2026-05-18T00:22:59.620416+00:00"}