{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HZD7HSABLRMISTV2JDA7IPQNIB","short_pith_number":"pith:HZD7HSAB","schema_version":"1.0","canonical_sha256":"3e47f3c8015c58894eba48c1f43e0d404b882fc072873643b4a7df9c1813198f","source":{"kind":"arxiv","id":"1805.07962","version":2},"attestation_state":"computed","paper":{"title":"A Nonconvex Projection Method for Robust PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Aritra Dutta, Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-05-21T09:49:06Z","abstract_excerpt":"Robust principal component analysis (RPCA) is a well-studied problem with the goal of decomposing a matrix into the sum of low-rank and sparse components. In this paper, we propose a nonconvex feasibility reformulation of RPCA problem and apply an alternating projection method to solve it. To the best of our knowledge, we are the first to propose a method that solves RPCA problem without considering any objective function, convex relaxation, or surrogate convex constraints. We demonstrate through extensive numerical experiments on a variety of applications, including shadow removal, background"},"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":"1805.07962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-21T09:49:06Z","cross_cats_sorted":["cs.CV","cs.NA","math.NA"],"title_canon_sha256":"e6a1ab9aa52ceb6a5ced0630bcbd903261423c30ba63e344dba148df6d0ed2ef","abstract_canon_sha256":"47e8d8a35453faeba3b17a6ad677be9b3eca317131b58ff10b33a36a15277d7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:24.103270Z","signature_b64":"HCWXyzFet+gmCfaM8tIY7RPmN/9w8PZnZ3CTaZBjJ6ugXJKCdS4oQ0ryxTDFtq3hMTBAoRdkBywVZnCSzu/BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e47f3c8015c58894eba48c1f43e0d404b882fc072873643b4a7df9c1813198f","last_reissued_at":"2026-07-05T00:35:24.102822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:24.102822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonconvex Projection Method for Robust PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Aritra Dutta, Filip Hanzely, Peter Richt\\'arik","submitted_at":"2018-05-21T09:49:06Z","abstract_excerpt":"Robust principal component analysis (RPCA) is a well-studied problem with the goal of decomposing a matrix into the sum of low-rank and sparse components. In this paper, we propose a nonconvex feasibility reformulation of RPCA problem and apply an alternating projection method to solve it. To the best of our knowledge, we are the first to propose a method that solves RPCA problem without considering any objective function, convex relaxation, or surrogate convex constraints. We demonstrate through extensive numerical experiments on a variety of applications, including shadow removal, background"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07962","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.07962/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.07962","created_at":"2026-07-05T00:35:24.102879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07962v2","created_at":"2026-07-05T00:35:24.102879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07962","created_at":"2026-07-05T00:35:24.102879+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZD7HSABLRMI","created_at":"2026-07-05T00:35:24.102879+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZD7HSABLRMISTV2","created_at":"2026-07-05T00:35:24.102879+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZD7HSAB","created_at":"2026-07-05T00:35:24.102879+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/HZD7HSABLRMISTV2JDA7IPQNIB","json":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB.json","graph_json":"https://pith.science/api/pith-number/HZD7HSABLRMISTV2JDA7IPQNIB/graph.json","events_json":"https://pith.science/api/pith-number/HZD7HSABLRMISTV2JDA7IPQNIB/events.json","paper":"https://pith.science/paper/HZD7HSAB"},"agent_actions":{"view_html":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB","download_json":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB.json","view_paper":"https://pith.science/paper/HZD7HSAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07962&json=true","fetch_graph":"https://pith.science/api/pith-number/HZD7HSABLRMISTV2JDA7IPQNIB/graph.json","fetch_events":"https://pith.science/api/pith-number/HZD7HSABLRMISTV2JDA7IPQNIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB/action/storage_attestation","attest_author":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB/action/author_attestation","sign_citation":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB/action/citation_signature","submit_replication":"https://pith.science/pith/HZD7HSABLRMISTV2JDA7IPQNIB/action/replication_record"}},"created_at":"2026-07-05T00:35:24.102879+00:00","updated_at":"2026-07-05T00:35:24.102879+00:00"}