{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7WPJVACZORVFERESVFHASEJDD6","short_pith_number":"pith:7WPJVACZ","schema_version":"1.0","canonical_sha256":"fd9e9a8059746a524492a94e0911231f8ff523793697daa5790de4828dd79777","source":{"kind":"arxiv","id":"1702.01847","version":1},"attestation_state":"computed","paper":{"title":"Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2017-02-07T02:08:51Z","abstract_excerpt":"We study a data model in which the data matrix D can be expressed as D = L + S + C, where L is a low rank matrix, S an element-wise sparse matrix and C a matrix whose non-zero columns are outlying data points. To date, robust PCA algorithms have solely considered models with either S or C, but not both. As such, existing algorithms cannot account for simultaneous element-wise and column-wise corruptions. In this paper, a new robust PCA algorithm that is robust to simultaneous types of corruption is proposed. Our approach hinges on the sparse approximation of a sparsely corrupted column so that"},"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":"1702.01847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-02-07T02:08:51Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"b2a5a1939eaef5f4a0a4debf4ef92e77b5fa76f31d02b44ee5539954d714d9da","abstract_canon_sha256":"4f330b677d04b7292d17c850c63135d6544222727cd904c3717710bc9aeff223"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:15.313667Z","signature_b64":"/wu47N2Mm00dVa/J42jHmjnQV5p/MMR/tNSYhxAy3FHC3v4JqUnbeXB9Zq3D6N3IA9xEzseE9PK+SgkrPLCeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd9e9a8059746a524492a94e0911231f8ff523793697daa5790de4828dd79777","last_reissued_at":"2026-05-17T23:55:15.313200Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:15.313200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low Rank Matrix Recovery with Simultaneous Presence of Outliers and Sparse Corruption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2017-02-07T02:08:51Z","abstract_excerpt":"We study a data model in which the data matrix D can be expressed as D = L + S + C, where L is a low rank matrix, S an element-wise sparse matrix and C a matrix whose non-zero columns are outlying data points. To date, robust PCA algorithms have solely considered models with either S or C, but not both. As such, existing algorithms cannot account for simultaneous element-wise and column-wise corruptions. In this paper, a new robust PCA algorithm that is robust to simultaneous types of corruption is proposed. Our approach hinges on the sparse approximation of a sparsely corrupted column so that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01847","kind":"arxiv","version":1},"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":"1702.01847","created_at":"2026-05-17T23:55:15.313300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01847v1","created_at":"2026-05-17T23:55:15.313300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01847","created_at":"2026-05-17T23:55:15.313300+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WPJVACZORVF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WPJVACZORVFERES","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WPJVACZ","created_at":"2026-05-18T12:31:05.417338+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/7WPJVACZORVFERESVFHASEJDD6","json":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6.json","graph_json":"https://pith.science/api/pith-number/7WPJVACZORVFERESVFHASEJDD6/graph.json","events_json":"https://pith.science/api/pith-number/7WPJVACZORVFERESVFHASEJDD6/events.json","paper":"https://pith.science/paper/7WPJVACZ"},"agent_actions":{"view_html":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6","download_json":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6.json","view_paper":"https://pith.science/paper/7WPJVACZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01847&json=true","fetch_graph":"https://pith.science/api/pith-number/7WPJVACZORVFERESVFHASEJDD6/graph.json","fetch_events":"https://pith.science/api/pith-number/7WPJVACZORVFERESVFHASEJDD6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6/action/storage_attestation","attest_author":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6/action/author_attestation","sign_citation":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6/action/citation_signature","submit_replication":"https://pith.science/pith/7WPJVACZORVFERESVFHASEJDD6/action/replication_record"}},"created_at":"2026-05-17T23:55:15.313300+00:00","updated_at":"2026-05-17T23:55:15.313300+00:00"}