{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:66BB5L5WDH6OQDBEUYRLRPTFTR","short_pith_number":"pith:66BB5L5W","schema_version":"1.0","canonical_sha256":"f7821eafb619fce80c24a622b8be659c5b2788b1571df8276c3f2a3d02ec6cc7","source":{"kind":"arxiv","id":"1803.10290","version":2},"attestation_state":"computed","paper":{"title":"Fast Computation of Robust Subspace Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Holger Cevallos-Valdiviezo, Stefan Van Aelst","submitted_at":"2018-03-27T19:49:56Z","abstract_excerpt":"Dimension reduction is often an important step in the analysis of high-dimensional data. PCA is a popular technique to find the best low-dimensional approximation of high-dimensional data. However, classical PCA is very sensitive to atypical data. Robust methods to estimate the low-dimensional subspace that best approximates the regular data have been proposed. However, for high-dimensional data his algorithms become computationally expensive. Alternative algorithms for the robust subspace estimators are proposed that are better suited to compute the solution for high-dimensional problems. The"},"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":"1803.10290","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-03-27T19:49:56Z","cross_cats_sorted":[],"title_canon_sha256":"e87d7a7b3de9421da65424aece504e64574770cf43c2c78156740b6697c3a910","abstract_canon_sha256":"e3a8af9d36418b0efa593cef45b4dab141db160a1a62ebdd9b87df0de5b50e48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.073605Z","signature_b64":"BSKR2x7SG7X/du6JJ2gF//UyjZMoE/RtTmJcZYAARyYHO5cGgcFLp8Gr1JoRkq6nmGl6ByT0JY+G6tgrGfx6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7821eafb619fce80c24a622b8be659c5b2788b1571df8276c3f2a3d02ec6cc7","last_reissued_at":"2026-05-17T23:56:34.072880Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.072880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Computation of Robust Subspace Estimators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Holger Cevallos-Valdiviezo, Stefan Van Aelst","submitted_at":"2018-03-27T19:49:56Z","abstract_excerpt":"Dimension reduction is often an important step in the analysis of high-dimensional data. PCA is a popular technique to find the best low-dimensional approximation of high-dimensional data. However, classical PCA is very sensitive to atypical data. Robust methods to estimate the low-dimensional subspace that best approximates the regular data have been proposed. However, for high-dimensional data his algorithms become computationally expensive. Alternative algorithms for the robust subspace estimators are proposed that are better suited to compute the solution for high-dimensional problems. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10290","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":""},"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":"1803.10290","created_at":"2026-05-17T23:56:34.072984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10290v2","created_at":"2026-05-17T23:56:34.072984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10290","created_at":"2026-05-17T23:56:34.072984+00:00"},{"alias_kind":"pith_short_12","alias_value":"66BB5L5WDH6O","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"66BB5L5WDH6OQDBE","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"66BB5L5W","created_at":"2026-05-18T12:32:08.215937+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/66BB5L5WDH6OQDBEUYRLRPTFTR","json":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR.json","graph_json":"https://pith.science/api/pith-number/66BB5L5WDH6OQDBEUYRLRPTFTR/graph.json","events_json":"https://pith.science/api/pith-number/66BB5L5WDH6OQDBEUYRLRPTFTR/events.json","paper":"https://pith.science/paper/66BB5L5W"},"agent_actions":{"view_html":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR","download_json":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR.json","view_paper":"https://pith.science/paper/66BB5L5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10290&json=true","fetch_graph":"https://pith.science/api/pith-number/66BB5L5WDH6OQDBEUYRLRPTFTR/graph.json","fetch_events":"https://pith.science/api/pith-number/66BB5L5WDH6OQDBEUYRLRPTFTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR/action/storage_attestation","attest_author":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR/action/author_attestation","sign_citation":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR/action/citation_signature","submit_replication":"https://pith.science/pith/66BB5L5WDH6OQDBEUYRLRPTFTR/action/replication_record"}},"created_at":"2026-05-17T23:56:34.072984+00:00","updated_at":"2026-05-17T23:56:34.072984+00:00"}