{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RB4PUUPKKVFAN3OV7S2NU4MMU3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8ad7ff3b28f7fd5bac6f7a896dbeb765809486d8d421344470191f794eea4bdd","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-28T15:33:13Z","title_canon_sha256":"ad81483201c8236df2b1a2890ee3a583fb5364061d904d1f4f552063d769fe45"},"schema_version":"1.0","source":{"id":"1410.7660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7660","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7660v1","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7660","created_at":"2026-05-18T02:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"RB4PUUPKKVFA","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RB4PUUPKKVFAN3OV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RB4PUUPK","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:add71db3fecd4857da6f59bf6049fee3875c3880167570af8bc908afc43fc355","target":"graph","created_at":"2026-05-18T02:39:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We propose a new method for robust PCA -- the task of recovering a low-rank matrix from sparse corruptions that are of unknown value and support. Our method involves alternating between projecting appropriate residuals onto the set of low-rank matrices, and the set of sparse matrices; each projection is {\\em non-convex} but easy to compute. In spite of this non-convexity, we establish exact recovery of the low-rank matrix, under the same conditions that are required by existing methods (which are based on convex optimization). For an $m \\times n$ input matrix ($m \\leq n)$, our method has a run","authors_text":"Animashree Anandkumar, Praneeth Netrapalli, Prateek Jain, Sujay Sanghavi, U N Niranjan","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-28T15:33:13Z","title":"Non-convex Robust PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7660","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:27a1b118946e39111932042b785ab3fe1d0c03c760fb7db72c70acf6c206fa67","target":"record","created_at":"2026-05-18T02:39:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8ad7ff3b28f7fd5bac6f7a896dbeb765809486d8d421344470191f794eea4bdd","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-28T15:33:13Z","title_canon_sha256":"ad81483201c8236df2b1a2890ee3a583fb5364061d904d1f4f552063d769fe45"},"schema_version":"1.0","source":{"id":"1410.7660","kind":"arxiv","version":1}},"canonical_sha256":"8878fa51ea554a06edd5fcb4da718ca6d5616a5fe5bd4f8d0cc6ab24ed24c82a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8878fa51ea554a06edd5fcb4da718ca6d5616a5fe5bd4f8d0cc6ab24ed24c82a","first_computed_at":"2026-05-18T02:39:09.752332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:09.752332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H40vp9kpGKe2b1p8gsQKpaD0Z7h/k7z0L5dIFLNQ8sAgZkKzYbF3ph/IV/SM8bxQax3rPodjNpIZ73shtZAXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:09.752977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a1b118946e39111932042b785ab3fe1d0c03c760fb7db72c70acf6c206fa67","sha256:add71db3fecd4857da6f59bf6049fee3875c3880167570af8bc908afc43fc355"],"state_sha256":"687e7525e84df8611723c593ddb86379e4b91bb4bf0e04bc34dce47a5e787f6f"}