{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TOC5P6EGQDCPTH2P5DXDW5MI33","short_pith_number":"pith:TOC5P6EG","schema_version":"1.0","canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","source":{"kind":"arxiv","id":"1509.09236","version":3},"attestation_state":"computed","paper":{"title":"On the Complexity of Robust PCA and $\\ell_1$-norm Low-Rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Nicolas Gillis, Stephen A. Vavasis","submitted_at":"2015-09-30T16:05:50Z","abstract_excerpt":"The low-rank matrix approximation problem with respect to the component-wise $\\ell_1$-norm ($\\ell_1$-LRA), which is closely related to robust principal component analysis (PCA), has become a very popular tool in data mining and machine learning. Robust PCA aims at recovering a low-rank matrix that was perturbed with sparse noise, with applications for example in foreground-background video separation. Although $\\ell_1$-LRA is strongly believed to be NP-hard, there is, to the best of our knowledge, no formal proof of this fact. In this paper, we prove that $\\ell_1$-LRA is NP-hard, already in th"},"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":"1509.09236","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-30T16:05:50Z","cross_cats_sorted":["cs.CC","math.NA","math.OC"],"title_canon_sha256":"8e2e6d5001becd9da4c78cb1b12c4035f8d493750908ea973a8a89025a71596b","abstract_canon_sha256":"afba7a4cc43fcb029027a405e6fe5331a7abe43ee19f66a13df45bab89e5d69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:05.935015Z","signature_b64":"WvW9/Kv5uyNNmTQ1ZisbGPs58BGzXFvr84EYqmbflzn+KI5hVG1JsiMswb6hldqrF+M9jEVKHPQqiZiw3EmBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","last_reissued_at":"2026-05-17T23:58:05.934564Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:05.934564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Robust PCA and $\\ell_1$-norm Low-Rank Matrix Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA","math.OC"],"primary_cat":"cs.LG","authors_text":"Nicolas Gillis, Stephen A. Vavasis","submitted_at":"2015-09-30T16:05:50Z","abstract_excerpt":"The low-rank matrix approximation problem with respect to the component-wise $\\ell_1$-norm ($\\ell_1$-LRA), which is closely related to robust principal component analysis (PCA), has become a very popular tool in data mining and machine learning. Robust PCA aims at recovering a low-rank matrix that was perturbed with sparse noise, with applications for example in foreground-background video separation. Although $\\ell_1$-LRA is strongly believed to be NP-hard, there is, to the best of our knowledge, no formal proof of this fact. In this paper, we prove that $\\ell_1$-LRA is NP-hard, already in th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09236","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":"1509.09236","created_at":"2026-05-17T23:58:05.934638+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.09236v3","created_at":"2026-05-17T23:58:05.934638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09236","created_at":"2026-05-17T23:58:05.934638+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOC5P6EGQDCP","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOC5P6EGQDCPTH2P","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOC5P6EG","created_at":"2026-05-18T12:29:42.218222+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/TOC5P6EGQDCPTH2P5DXDW5MI33","json":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33.json","graph_json":"https://pith.science/api/pith-number/TOC5P6EGQDCPTH2P5DXDW5MI33/graph.json","events_json":"https://pith.science/api/pith-number/TOC5P6EGQDCPTH2P5DXDW5MI33/events.json","paper":"https://pith.science/paper/TOC5P6EG"},"agent_actions":{"view_html":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33","download_json":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33.json","view_paper":"https://pith.science/paper/TOC5P6EG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.09236&json=true","fetch_graph":"https://pith.science/api/pith-number/TOC5P6EGQDCPTH2P5DXDW5MI33/graph.json","fetch_events":"https://pith.science/api/pith-number/TOC5P6EGQDCPTH2P5DXDW5MI33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/action/storage_attestation","attest_author":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/action/author_attestation","sign_citation":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/action/citation_signature","submit_replication":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/action/replication_record"}},"created_at":"2026-05-17T23:58:05.934638+00:00","updated_at":"2026-05-17T23:58:05.934638+00:00"}