{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TOC5P6EGQDCPTH2P5DXDW5MI33","short_pith_number":"pith:TOC5P6EG","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"},"canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","source":{"kind":"arxiv","id":"1509.09236","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09236","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09236v3","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09236","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"TOC5P6EGQDCP","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TOC5P6EGQDCPTH2P","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TOC5P6EG","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TOC5P6EGQDCPTH2P5DXDW5MI33","target":"record","payload":{"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"},"canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","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"},"source_kind":"arxiv","source_id":"1509.09236","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RR/ymkWtD+8AvtZEUav6euirB76+IkE7YboaFvCa9cieczh9bjGQ/oaGRHa8gMsFTbZc8UDIsM3JXBjgwJwqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:15:52.681122Z"},"content_sha256":"e31c63cbefe0bce5147a2052d134ae492d886bb90c6bfaa7eee86d17ba14b497","schema_version":"1.0","event_id":"sha256:e31c63cbefe0bce5147a2052d134ae492d886bb90c6bfaa7eee86d17ba14b497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TOC5P6EGQDCPTH2P5DXDW5MI33","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvNfNdZ3RWUerNbzZU1nSjILCxfKDB0BeUrLdVoTrVmsYMPyB58vn/eyBk79axKlNUOTxMHKrcIo0OdZp88dDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:15:52.681520Z"},"content_sha256":"93934c49e3d7cf84d3cb1e89f6efb201c8df0c23468c405410652186064f715f","schema_version":"1.0","event_id":"sha256:93934c49e3d7cf84d3cb1e89f6efb201c8df0c23468c405410652186064f715f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/bundle.json","state_url":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:15:52Z","links":{"resolver":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33","bundle":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/bundle.json","state":"https://pith.science/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOC5P6EGQDCPTH2P5DXDW5MI33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TOC5P6EGQDCPTH2P5DXDW5MI33","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":"afba7a4cc43fcb029027a405e6fe5331a7abe43ee19f66a13df45bab89e5d69d","cross_cats_sorted":["cs.CC","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-30T16:05:50Z","title_canon_sha256":"8e2e6d5001becd9da4c78cb1b12c4035f8d493750908ea973a8a89025a71596b"},"schema_version":"1.0","source":{"id":"1509.09236","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.09236","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1509.09236v3","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.09236","created_at":"2026-05-17T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"TOC5P6EGQDCP","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TOC5P6EGQDCPTH2P","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TOC5P6EG","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:93934c49e3d7cf84d3cb1e89f6efb201c8df0c23468c405410652186064f715f","target":"graph","created_at":"2026-05-17T23:58:05Z","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":"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","authors_text":"Nicolas Gillis, Stephen A. Vavasis","cross_cats":["cs.CC","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-30T16:05:50Z","title":"On the Complexity of Robust PCA and $\\ell_1$-norm Low-Rank Matrix Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.09236","kind":"arxiv","version":3},"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:e31c63cbefe0bce5147a2052d134ae492d886bb90c6bfaa7eee86d17ba14b497","target":"record","created_at":"2026-05-17T23:58:05Z","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":"afba7a4cc43fcb029027a405e6fe5331a7abe43ee19f66a13df45bab89e5d69d","cross_cats_sorted":["cs.CC","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-30T16:05:50Z","title_canon_sha256":"8e2e6d5001becd9da4c78cb1b12c4035f8d493750908ea973a8a89025a71596b"},"schema_version":"1.0","source":{"id":"1509.09236","kind":"arxiv","version":3}},"canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b85d7f88680c4f99f4fe8ee3b7588ded2a56a7d239ac6da31607e4cfea1b280","first_computed_at":"2026-05-17T23:58:05.934564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:05.934564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WvW9/Kv5uyNNmTQ1ZisbGPs58BGzXFvr84EYqmbflzn+KI5hVG1JsiMswb6hldqrF+M9jEVKHPQqiZiw3EmBBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:05.935015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.09236","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e31c63cbefe0bce5147a2052d134ae492d886bb90c6bfaa7eee86d17ba14b497","sha256:93934c49e3d7cf84d3cb1e89f6efb201c8df0c23468c405410652186064f715f"],"state_sha256":"d739d9f5bb8b4dbd153ef85a0a6265a7c00889569c81111caf0272836498bc39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtZIHUshtqiV8IP2GvCe3nU10S20i03BLysjvcMzdF9LqRQwPmiOUfZR89IJbho+1+W9wRd8dQplsC+vStXfDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:15:52.684307Z","bundle_sha256":"e08fada1b7542889393df5f69ed495bba976d05c59718d8c2d51d39c34ac4a2b"}}