{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FNSX7R2JTLXFRA4SPVM7RKSVN3","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":"6d22e4f92168d59167c38eb2ff1ada57ab708b88bfe472e9d913faa4261bb418","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-09T07:27:01Z","title_canon_sha256":"c2640405460dd917fbaad9830119a1d311bb59d25a0b257b310e94aa196b785d"},"schema_version":"1.0","source":{"id":"1806.03430","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03430","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03430v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03430","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"FNSX7R2JTLXF","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FNSX7R2JTLXFRA4S","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FNSX7R2J","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:c6b8c04bb95998c658d713ed432231559334f5a226cc90d5530e0ace39a9ccd1","target":"graph","created_at":"2026-05-18T00:13:43Z","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":"Robust PCA has drawn significant attention in the last decade due to its success in numerous application domains, ranging from bio-informatics, statistics, and machine learning to image and video processing in computer vision. Robust PCA and its variants such as sparse PCA and stable PCA can be formulated as optimization problems with exploitable special structures. Many specialized efficient optimization methods have been proposed to solve robust PCA and related problems. In this paper we review existing optimization methods for solving convex and nonconvex relaxations/variants of robust PCA,","authors_text":"Necdet Serhat Aybat, Shiqian Ma","cross_cats":["cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-09T07:27:01Z","title":"Efficient Optimization Algorithms for Robust Principal Component Analysis and Its Variants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03430","kind":"arxiv","version":1},"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:a31899c528ab5b219e903c72907ade9b7050120427306a75bfd09d095da5f0f5","target":"record","created_at":"2026-05-18T00:13:43Z","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":"6d22e4f92168d59167c38eb2ff1ada57ab708b88bfe472e9d913faa4261bb418","cross_cats_sorted":["cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-09T07:27:01Z","title_canon_sha256":"c2640405460dd917fbaad9830119a1d311bb59d25a0b257b310e94aa196b785d"},"schema_version":"1.0","source":{"id":"1806.03430","kind":"arxiv","version":1}},"canonical_sha256":"2b657fc7499aee5883927d59f8aa556ed57bc7c23dfe02f38f387fa5d064139b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b657fc7499aee5883927d59f8aa556ed57bc7c23dfe02f38f387fa5d064139b","first_computed_at":"2026-05-18T00:13:43.423982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.423982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VE3Z0oiHYJp8gu7euMaRql3kTS1C1fRTR7DteEBAJTe3oM9k1bm1uyHoSnHfvy1HfPrxom7dNLQ2aV4MDHajCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.424580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03430","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a31899c528ab5b219e903c72907ade9b7050120427306a75bfd09d095da5f0f5","sha256:c6b8c04bb95998c658d713ed432231559334f5a226cc90d5530e0ace39a9ccd1"],"state_sha256":"8722c5d67c2202068c096a8a323b30afc5f68d1ae86ee1173ca7a30617904869"}