{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TNAXRRF6AVNAEBDTFIYBK2WRU5","short_pith_number":"pith:TNAXRRF6","schema_version":"1.0","canonical_sha256":"9b4178c4be055a0204732a30156ad1a7432208a0a138d560c8ac18b728f311b3","source":{"kind":"arxiv","id":"2506.16013","version":1},"attestation_state":"computed","paper":{"title":"A Fast Iterative Robust Principal Component Analysis Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.CE","authors_text":"Chris R. Johnson, Jixian Li, Timbwaoga Aime Judicael Ouermi","submitted_at":"2025-06-19T04:19:33Z","abstract_excerpt":"Principal Component Analysis (PCA) is widely used for dimensionality reduction and data analysis. However, PCA results are adversely affected by outliers often observed in real-world data. Existing robust PCA methods are often computationally expensive or exhibit limited robustness. In this work, we introduce a Fast Iterative Robust (FIR) PCA method by efficiently estimating the inliers center location and covariance. Our approach leverages Incremental PCA (IPCA) to iteratively construct a subset of data points that ensures improved location and covariance estimation that effectively mitigates"},"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":"2506.16013","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CE","submitted_at":"2025-06-19T04:19:33Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"b12f8197cacfbcfe3294ccd093f68b9d01d404bb852dbc99ace30f5d491e726e","abstract_canon_sha256":"f0a5c74936849c0c27c4b663324c447591391be9115676bbf1a1dc818b1429a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:28.168117Z","signature_b64":"TBXmyCjDwHAlwdKpvdZMRrfqTIt1xS5J5zWCxbpawhj9HWzwKeAWyH+SHnCF3hBkQ1rnFowix4qOPwtUy3qIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b4178c4be055a0204732a30156ad1a7432208a0a138d560c8ac18b728f311b3","last_reissued_at":"2026-07-05T11:24:28.167598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:28.167598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Iterative Robust Principal Component Analysis Method","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.CE","authors_text":"Chris R. Johnson, Jixian Li, Timbwaoga Aime Judicael Ouermi","submitted_at":"2025-06-19T04:19:33Z","abstract_excerpt":"Principal Component Analysis (PCA) is widely used for dimensionality reduction and data analysis. However, PCA results are adversely affected by outliers often observed in real-world data. Existing robust PCA methods are often computationally expensive or exhibit limited robustness. In this work, we introduce a Fast Iterative Robust (FIR) PCA method by efficiently estimating the inliers center location and covariance. Our approach leverages Incremental PCA (IPCA) to iteratively construct a subset of data points that ensures improved location and covariance estimation that effectively mitigates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.16013/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":"2506.16013","created_at":"2026-07-05T11:24:28.167662+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16013v1","created_at":"2026-07-05T11:24:28.167662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16013","created_at":"2026-07-05T11:24:28.167662+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNAXRRF6AVNA","created_at":"2026-07-05T11:24:28.167662+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNAXRRF6AVNAEBDT","created_at":"2026-07-05T11:24:28.167662+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNAXRRF6","created_at":"2026-07-05T11:24:28.167662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08081","citing_title":"Robust Heteroskedastic Matrix Factorization: A Generalization of PCA that Flags Outliers and Handles Missing Data","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5","json":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5.json","graph_json":"https://pith.science/api/pith-number/TNAXRRF6AVNAEBDTFIYBK2WRU5/graph.json","events_json":"https://pith.science/api/pith-number/TNAXRRF6AVNAEBDTFIYBK2WRU5/events.json","paper":"https://pith.science/paper/TNAXRRF6"},"agent_actions":{"view_html":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5","download_json":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5.json","view_paper":"https://pith.science/paper/TNAXRRF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16013&json=true","fetch_graph":"https://pith.science/api/pith-number/TNAXRRF6AVNAEBDTFIYBK2WRU5/graph.json","fetch_events":"https://pith.science/api/pith-number/TNAXRRF6AVNAEBDTFIYBK2WRU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5/action/storage_attestation","attest_author":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5/action/author_attestation","sign_citation":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5/action/citation_signature","submit_replication":"https://pith.science/pith/TNAXRRF6AVNAEBDTFIYBK2WRU5/action/replication_record"}},"created_at":"2026-07-05T11:24:28.167662+00:00","updated_at":"2026-07-05T11:24:28.167662+00:00"}