{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CP67ANVW2HUJAXOTH6JTFWC65E","short_pith_number":"pith:CP67ANVW","schema_version":"1.0","canonical_sha256":"13fdf036b6d1e8905dd33f9332d85ee9094c606820d609bf0e8acdf792f638b9","source":{"kind":"arxiv","id":"1609.04789","version":3},"attestation_state":"computed","paper":{"title":"Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2016-09-15T19:25:55Z","abstract_excerpt":"This paper presents a remarkably simple, yet powerful, algorithm termed Coherence Pursuit (CoP) to robust Principal Component Analysis (PCA). As inliers lie in a low dimensional subspace and are mostly correlated, an inlier is likely to have strong mutual coherence with a large number of data points. By contrast, outliers either do not admit low dimensional structures or form small clusters. In either case, an outlier is unlikely to bear strong resemblance to a large number of data points. Given that, CoP sets an outlier apart from an inlier by comparing their coherence with the rest of the da"},"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":"1609.04789","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-15T19:25:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"47bb68bf2c7599391bfab861a4e3949e290e42340bdb0fe35674dd343178acbc","abstract_canon_sha256":"b449af065fe15f1139be8f60c870427bcb0dff75b7fe486319a2585b2b4fd40c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:39.512799Z","signature_b64":"FA/+0c28QFJyfQm3awQ3UEmegNMoOFPjvZ6toldXrB2qDo2Zi2czO4Vb4iWBL9p0LRJRry6q5OhwqgJFxjo/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13fdf036b6d1e8905dd33f9332d85ee9094c606820d609bf0e8acdf792f638b9","last_reissued_at":"2026-05-18T00:29:39.512395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:39.512395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"George Atia, Mostafa Rahmani","submitted_at":"2016-09-15T19:25:55Z","abstract_excerpt":"This paper presents a remarkably simple, yet powerful, algorithm termed Coherence Pursuit (CoP) to robust Principal Component Analysis (PCA). As inliers lie in a low dimensional subspace and are mostly correlated, an inlier is likely to have strong mutual coherence with a large number of data points. By contrast, outliers either do not admit low dimensional structures or form small clusters. In either case, an outlier is unlikely to bear strong resemblance to a large number of data points. Given that, CoP sets an outlier apart from an inlier by comparing their coherence with the rest of the da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04789","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":"1609.04789","created_at":"2026-05-18T00:29:39.512456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04789v3","created_at":"2026-05-18T00:29:39.512456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04789","created_at":"2026-05-18T00:29:39.512456+00:00"},{"alias_kind":"pith_short_12","alias_value":"CP67ANVW2HUJ","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CP67ANVW2HUJAXOT","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CP67ANVW","created_at":"2026-05-18T12:30:09.641336+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/CP67ANVW2HUJAXOTH6JTFWC65E","json":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E.json","graph_json":"https://pith.science/api/pith-number/CP67ANVW2HUJAXOTH6JTFWC65E/graph.json","events_json":"https://pith.science/api/pith-number/CP67ANVW2HUJAXOTH6JTFWC65E/events.json","paper":"https://pith.science/paper/CP67ANVW"},"agent_actions":{"view_html":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E","download_json":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E.json","view_paper":"https://pith.science/paper/CP67ANVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04789&json=true","fetch_graph":"https://pith.science/api/pith-number/CP67ANVW2HUJAXOTH6JTFWC65E/graph.json","fetch_events":"https://pith.science/api/pith-number/CP67ANVW2HUJAXOTH6JTFWC65E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E/action/storage_attestation","attest_author":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E/action/author_attestation","sign_citation":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E/action/citation_signature","submit_replication":"https://pith.science/pith/CP67ANVW2HUJAXOTH6JTFWC65E/action/replication_record"}},"created_at":"2026-05-18T00:29:39.512456+00:00","updated_at":"2026-05-18T00:29:39.512456+00:00"}