{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2LUYNEQ4QXESKIHZF7NUOE3PVW","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":"6a7100a4d69a77b1acf1062742c957a8197f730b763151005e7589e1a72395f5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T07:24:36Z","title_canon_sha256":"9af30af6f679d4536b1e7866cbcd1e067f3572824a5506afd2b3b593a04ea983"},"schema_version":"1.0","source":{"id":"1806.05833","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05833","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05833v2","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05833","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"2LUYNEQ4QXES","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2LUYNEQ4QXESKIHZ","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2LUYNEQ4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:0467c61ac08c2815ce94b59780a9548f8848bfc8e470b35300222305804388f2","target":"graph","created_at":"2026-05-17T23:48:11Z","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":"This paper deals with robust regression and subspace estimation and more precisely with the problem of minimizing a saturated loss function. In particular, we focus on computational complexity issues and show that an exact algorithm with polynomial time-complexity with respect to the number of data can be devised for robust regression and subspace estimation. This result is obtained by adopting a classification point of view and relating the problems to the search for a linear model that can approximate the maximal number of points with a given error. Approximate variants of the algorithms bas","authors_text":"Fabien Lauer (ABC)","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T07:24:36Z","title":"On the exact minimization of saturated loss functions for robust regression and subspace estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05833","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:afa53a32ae0b78b1bdcf66b52d57491bbabd0133b0743621dd023681c97938f0","target":"record","created_at":"2026-05-17T23:48:11Z","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":"6a7100a4d69a77b1acf1062742c957a8197f730b763151005e7589e1a72395f5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T07:24:36Z","title_canon_sha256":"9af30af6f679d4536b1e7866cbcd1e067f3572824a5506afd2b3b593a04ea983"},"schema_version":"1.0","source":{"id":"1806.05833","kind":"arxiv","version":2}},"canonical_sha256":"d2e986921c85c92520f92fdb47136fad809abdfd83ef13748e46790bc6b028af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2e986921c85c92520f92fdb47136fad809abdfd83ef13748e46790bc6b028af","first_computed_at":"2026-05-17T23:48:11.643050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:11.643050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KtBeqqKHDjYjaLuTE7/2bizTpLYX5qIJRXRDP9nqKRZW2RpfSl6v4hRx2ygIUMWpnZZpCbZskq6uCdcLyjmVAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:11.643729Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05833","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afa53a32ae0b78b1bdcf66b52d57491bbabd0133b0743621dd023681c97938f0","sha256:0467c61ac08c2815ce94b59780a9548f8848bfc8e470b35300222305804388f2"],"state_sha256":"38de50912a4024dbf3965999b65966acf628b7b48fe3faf6d186122315700d4f"}