{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PWDWUBU63MBMVAZ4BGHWM7CHL2","short_pith_number":"pith:PWDWUBU6","schema_version":"1.0","canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","source":{"kind":"arxiv","id":"1112.3946","version":2},"attestation_state":"computed","paper":{"title":"Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Zhang, Jian-Feng Cai, Jubo Zhu, Lizhi Cheng","submitted_at":"2011-12-16T20:40:23Z","abstract_excerpt":"The common task in matrix completion (MC) and robust principle component analysis (RPCA) is to recover a low-rank matrix from a given data matrix. These problems gained great attention from various areas in applied sciences recently, especially after the publication of the pioneering works of Cand`es et al.. One fundamental result in MC and RPCA is that nuclear norm based convex optimizations lead to the exact low-rank matrix recovery under suitable conditions. In this paper, we extend this result by showing that strongly convex optimizations can guarantee the exact low-rank matrix recovery as"},"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":"1112.3946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-16T20:40:23Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"502b2a29be9aa725337ea20138e5242f07096ab2db70091cd208bbc9e596a37f","abstract_canon_sha256":"27b8bea876f7154be40a3aced12b00531210b01767836eeb2f993a9e41d09c95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:14.624710Z","signature_b64":"dxsrFxr5FVIPZu1e7VChqbVRvz8Be/J2EZAbI/lRm8ZXKkJmXGzxWQevI9gnPWBKBkpmdG1fh/bO5Ww0W0OoBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d876a069edb02ca833c098f667c475e8163113368de4105f685574a5ee3a60c","last_reissued_at":"2026-05-18T04:05:14.624124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:14.624124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strongly Convex Programming for Exact Matrix Completion and Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hui Zhang, Jian-Feng Cai, Jubo Zhu, Lizhi Cheng","submitted_at":"2011-12-16T20:40:23Z","abstract_excerpt":"The common task in matrix completion (MC) and robust principle component analysis (RPCA) is to recover a low-rank matrix from a given data matrix. These problems gained great attention from various areas in applied sciences recently, especially after the publication of the pioneering works of Cand`es et al.. One fundamental result in MC and RPCA is that nuclear norm based convex optimizations lead to the exact low-rank matrix recovery under suitable conditions. In this paper, we extend this result by showing that strongly convex optimizations can guarantee the exact low-rank matrix recovery as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.3946","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":"1112.3946","created_at":"2026-05-18T04:05:14.624219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.3946v2","created_at":"2026-05-18T04:05:14.624219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.3946","created_at":"2026-05-18T04:05:14.624219+00:00"},{"alias_kind":"pith_short_12","alias_value":"PWDWUBU63MBM","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PWDWUBU63MBMVAZ4","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PWDWUBU6","created_at":"2026-05-18T12:26:39.201973+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/PWDWUBU63MBMVAZ4BGHWM7CHL2","json":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2.json","graph_json":"https://pith.science/api/pith-number/PWDWUBU63MBMVAZ4BGHWM7CHL2/graph.json","events_json":"https://pith.science/api/pith-number/PWDWUBU63MBMVAZ4BGHWM7CHL2/events.json","paper":"https://pith.science/paper/PWDWUBU6"},"agent_actions":{"view_html":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2","download_json":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2.json","view_paper":"https://pith.science/paper/PWDWUBU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.3946&json=true","fetch_graph":"https://pith.science/api/pith-number/PWDWUBU63MBMVAZ4BGHWM7CHL2/graph.json","fetch_events":"https://pith.science/api/pith-number/PWDWUBU63MBMVAZ4BGHWM7CHL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/action/storage_attestation","attest_author":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/action/author_attestation","sign_citation":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/action/citation_signature","submit_replication":"https://pith.science/pith/PWDWUBU63MBMVAZ4BGHWM7CHL2/action/replication_record"}},"created_at":"2026-05-18T04:05:14.624219+00:00","updated_at":"2026-05-18T04:05:14.624219+00:00"}