{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NIZDOB4ME256FXR4RJL53CIFJY","short_pith_number":"pith:NIZDOB4M","schema_version":"1.0","canonical_sha256":"6a3237078c26bbe2de3c8a57dd89054e18215a92b75bec82e8cb9e5a2a767911","source":{"kind":"arxiv","id":"1211.1041","version":3},"attestation_state":"computed","paper":{"title":"Algorithms and Hardness for Robust Subspace Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CC","authors_text":"Ankur Moitra, Moritz Hardt","submitted_at":"2012-11-05T21:39:22Z","abstract_excerpt":"We consider a fundamental problem in unsupervised learning called \\emph{subspace recovery}: given a collection of $m$ points in $\\mathbb{R}^n$, if many but not necessarily all of these points are contained in a $d$-dimensional subspace $T$ can we find it? The points contained in $T$ are called {\\em inliers} and the remaining points are {\\em outliers}. This problem has received considerable attention in computer science and in statistics. Yet efficient algorithms from computer science are not robust to {\\em adversarial} outliers, and the estimators from robust statistics are hard to compute in "},"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":"1211.1041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-11-05T21:39:22Z","cross_cats_sorted":["cs.DS","cs.IT","cs.LG","math.IT"],"title_canon_sha256":"6669b0179ae60b4f9df2dc30582365f97fcff249b04b4c827e09385a0a063b55","abstract_canon_sha256":"48c561070416955d01456cb948ecb24bbcb3df4118f40847e41c5fddba62aab6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.288670Z","signature_b64":"k+eGiW+Yh4xP4Is6bWtBWI4eaHDRyvBJN5schsjQdiJxoRAApAlszS6sAuFvV8Gm/pM+hbYv5FCNQAbcQ8SVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3237078c26bbe2de3c8a57dd89054e18215a92b75bec82e8cb9e5a2a767911","last_reissued_at":"2026-05-18T03:05:36.288202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.288202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms and Hardness for Robust Subspace Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","cs.LG","math.IT"],"primary_cat":"cs.CC","authors_text":"Ankur Moitra, Moritz Hardt","submitted_at":"2012-11-05T21:39:22Z","abstract_excerpt":"We consider a fundamental problem in unsupervised learning called \\emph{subspace recovery}: given a collection of $m$ points in $\\mathbb{R}^n$, if many but not necessarily all of these points are contained in a $d$-dimensional subspace $T$ can we find it? The points contained in $T$ are called {\\em inliers} and the remaining points are {\\em outliers}. This problem has received considerable attention in computer science and in statistics. Yet efficient algorithms from computer science are not robust to {\\em adversarial} outliers, and the estimators from robust statistics are hard to compute in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1041","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":"1211.1041","created_at":"2026-05-18T03:05:36.288269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1041v3","created_at":"2026-05-18T03:05:36.288269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1041","created_at":"2026-05-18T03:05:36.288269+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIZDOB4ME256","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIZDOB4ME256FXR4","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIZDOB4M","created_at":"2026-05-18T12:27:16.716162+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/NIZDOB4ME256FXR4RJL53CIFJY","json":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY.json","graph_json":"https://pith.science/api/pith-number/NIZDOB4ME256FXR4RJL53CIFJY/graph.json","events_json":"https://pith.science/api/pith-number/NIZDOB4ME256FXR4RJL53CIFJY/events.json","paper":"https://pith.science/paper/NIZDOB4M"},"agent_actions":{"view_html":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY","download_json":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY.json","view_paper":"https://pith.science/paper/NIZDOB4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1041&json=true","fetch_graph":"https://pith.science/api/pith-number/NIZDOB4ME256FXR4RJL53CIFJY/graph.json","fetch_events":"https://pith.science/api/pith-number/NIZDOB4ME256FXR4RJL53CIFJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY/action/storage_attestation","attest_author":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY/action/author_attestation","sign_citation":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY/action/citation_signature","submit_replication":"https://pith.science/pith/NIZDOB4ME256FXR4RJL53CIFJY/action/replication_record"}},"created_at":"2026-05-18T03:05:36.288269+00:00","updated_at":"2026-05-18T03:05:36.288269+00:00"}