{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EQVDET6YIRQTU5MLELSK3GLJPU","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":"09fc0db5017b24e8091d43e8d8a4de974f41dd50a31d877dd867b4ca8bde8865","cross_cats_sorted":["math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-18T00:47:22Z","title_canon_sha256":"e71ff232207a5b6f09f70580c6c9f38158c97a3665cf354dea6c2b48edbdcb25"},"schema_version":"1.0","source":{"id":"1202.4044","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4044","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4044v2","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4044","created_at":"2026-05-18T01:36:26Z"},{"alias_kind":"pith_short_12","alias_value":"EQVDET6YIRQT","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EQVDET6YIRQTU5ML","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EQVDET6Y","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:83af21bfdc5bdd9c5eb9de5ff16225f099f3525757a6a5d6277c6aedfe1c39dc","target":"graph","created_at":"2026-05-18T01:36:26Z","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":"Consider a dataset of vector-valued observations that consists of noisy inliers, which are explained well by a low-dimensional subspace, along with some number of outliers. This work describes a convex optimization problem, called REAPER, that can reliably fit a low-dimensional model to this type of data. This approach parameterizes linear subspaces using orthogonal projectors, and it uses a relaxation of the set of orthogonal projectors to reach the convex formulation. The paper provides an efficient algorithm for solving the REAPER problem, and it documents numerical experiments which confir","authors_text":"Gilad Lerman, Joel A. Tropp, Michael McCoy, Teng Zhang","cross_cats":["math.IT","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-18T00:47:22Z","title":"Robust computation of linear models by convex relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4044","kind":"arxiv","version":2},"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:4b17a5a761eedf683f78c012b30db1827b4dd7933c6d25d4b2a9a20fb4a3ca19","target":"record","created_at":"2026-05-18T01:36:26Z","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":"09fc0db5017b24e8091d43e8d8a4de974f41dd50a31d877dd867b4ca8bde8865","cross_cats_sorted":["math.IT","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-18T00:47:22Z","title_canon_sha256":"e71ff232207a5b6f09f70580c6c9f38158c97a3665cf354dea6c2b48edbdcb25"},"schema_version":"1.0","source":{"id":"1202.4044","kind":"arxiv","version":2}},"canonical_sha256":"242a324fd844613a758b22e4ad99697d280f90d739254d8e86b28fb726f2ce9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"242a324fd844613a758b22e4ad99697d280f90d739254d8e86b28fb726f2ce9d","first_computed_at":"2026-05-18T01:36:26.115524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:26.115524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RBJwol1BbPoK69npcRGdfLQ80ctJJUyKF1pBWlQJTtEtoHbWl984TA2I77DA748XvO3gxkNXqtnJe8IOGzUYBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:26.116094Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4044","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b17a5a761eedf683f78c012b30db1827b4dd7933c6d25d4b2a9a20fb4a3ca19","sha256:83af21bfdc5bdd9c5eb9de5ff16225f099f3525757a6a5d6277c6aedfe1c39dc"],"state_sha256":"86815e82b1402b613664ac16df891384de5923ef66cab7111d0592c1b5910504"}