{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N7E2ZVWU7XFLC6D5BVDMHEQBGW","short_pith_number":"pith:N7E2ZVWU","schema_version":"1.0","canonical_sha256":"6fc9acd6d4fdcab1787d0d46c392013598f6275df1216dfa90fecbd1a6e14bf0","source":{"kind":"arxiv","id":"1009.5055","version":3},"attestation_state":"computed","paper":{"title":"The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Minming Chen, Yi Ma, Zhouchen Lin","submitted_at":"2010-09-26T03:42:27Z","abstract_excerpt":"This paper proposes scalable and fast algorithms for solving the Robust PCA problem, namely recovering a low-rank matrix with an unknown fraction of its entries being arbitrarily corrupted. This problem arises in many applications, such as image processing, web data ranking, and bioinformatic data analysis. It was recently shown that under surprisingly broad conditions, the Robust PCA problem can be exactly solved via convex optimization that minimizes a combination of the nuclear norm and the $\\ell^1$-norm . In this paper, we apply the method of augmented Lagrange multipliers (ALM) to solve t"},"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":"1009.5055","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-09-26T03:42:27Z","cross_cats_sorted":["cs.NA","cs.SY"],"title_canon_sha256":"70ad881b8a8bed837af58f34114374e0ec5ccefce57a216197ef8415d8a642ba","abstract_canon_sha256":"c92ad7b0f5fa6fe6a040d76031a061c8c7e5638400835fe3bdc238b85f4ee156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.461834Z","signature_b64":"rGIrpdzIAJ+/1/p+oyWu7CX4zkx5qcejz72acE58BQI5ABQQg7yw9/Y+scz5v4KyTGt/QV2mEwUO5cRIlH9RBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc9acd6d4fdcab1787d0d46c392013598f6275df1216dfa90fecbd1a6e14bf0","last_reissued_at":"2026-05-18T03:10:12.461290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.461290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Minming Chen, Yi Ma, Zhouchen Lin","submitted_at":"2010-09-26T03:42:27Z","abstract_excerpt":"This paper proposes scalable and fast algorithms for solving the Robust PCA problem, namely recovering a low-rank matrix with an unknown fraction of its entries being arbitrarily corrupted. This problem arises in many applications, such as image processing, web data ranking, and bioinformatic data analysis. It was recently shown that under surprisingly broad conditions, the Robust PCA problem can be exactly solved via convex optimization that minimizes a combination of the nuclear norm and the $\\ell^1$-norm . In this paper, we apply the method of augmented Lagrange multipliers (ALM) to solve t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5055","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":"1009.5055","created_at":"2026-05-18T03:10:12.461370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5055v3","created_at":"2026-05-18T03:10:12.461370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5055","created_at":"2026-05-18T03:10:12.461370+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7E2ZVWU7XFL","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7E2ZVWU7XFLC6D5","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7E2ZVWU","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":4,"sample":[{"citing_arxiv_id":"1907.01121","citing_title":"An Iteratively Re-weighted Method for Problems with Sparsity-Inducing Norms","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2501.00677","citing_title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2503.13874","citing_title":"Multi-label feature selection based on binary hashing learning and dynamic graph constraints","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2507.17069","citing_title":"The Generalized Matrix Separation Problem: Algorithms","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW","json":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW.json","graph_json":"https://pith.science/api/pith-number/N7E2ZVWU7XFLC6D5BVDMHEQBGW/graph.json","events_json":"https://pith.science/api/pith-number/N7E2ZVWU7XFLC6D5BVDMHEQBGW/events.json","paper":"https://pith.science/paper/N7E2ZVWU"},"agent_actions":{"view_html":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW","download_json":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW.json","view_paper":"https://pith.science/paper/N7E2ZVWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5055&json=true","fetch_graph":"https://pith.science/api/pith-number/N7E2ZVWU7XFLC6D5BVDMHEQBGW/graph.json","fetch_events":"https://pith.science/api/pith-number/N7E2ZVWU7XFLC6D5BVDMHEQBGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW/action/storage_attestation","attest_author":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW/action/author_attestation","sign_citation":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW/action/citation_signature","submit_replication":"https://pith.science/pith/N7E2ZVWU7XFLC6D5BVDMHEQBGW/action/replication_record"}},"created_at":"2026-05-18T03:10:12.461370+00:00","updated_at":"2026-05-18T03:10:12.461370+00:00"}