{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2LUYNEQ4QXESKIHZF7NUOE3PVW","short_pith_number":"pith:2LUYNEQ4","canonical_record":{"source":{"id":"1806.05833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T07:24:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9af30af6f679d4536b1e7866cbcd1e067f3572824a5506afd2b3b593a04ea983","abstract_canon_sha256":"6a7100a4d69a77b1acf1062742c957a8197f730b763151005e7589e1a72395f5"},"schema_version":"1.0"},"canonical_sha256":"d2e986921c85c92520f92fdb47136fad809abdfd83ef13748e46790bc6b028af","source":{"kind":"arxiv","id":"1806.05833","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2LUYNEQ4QXESKIHZF7NUOE3PVW","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05833","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-15T07:24:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9af30af6f679d4536b1e7866cbcd1e067f3572824a5506afd2b3b593a04ea983","abstract_canon_sha256":"6a7100a4d69a77b1acf1062742c957a8197f730b763151005e7589e1a72395f5"},"schema_version":"1.0"},"canonical_sha256":"d2e986921c85c92520f92fdb47136fad809abdfd83ef13748e46790bc6b028af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.643729Z","signature_b64":"KtBeqqKHDjYjaLuTE7/2bizTpLYX5qIJRXRDP9nqKRZW2RpfSl6v4hRx2ygIUMWpnZZpCbZskq6uCdcLyjmVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2e986921c85c92520f92fdb47136fad809abdfd83ef13748e46790bc6b028af","last_reissued_at":"2026-05-17T23:48:11.643050Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.643050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05833","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsMqFb7w1aNUTyKqVdha6b4uVgOPfONLo8McvwnQqSRMFgKlVJQdWIeefpxUYd6AKhT8UmuGkzGwMYwobR3hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:31:57.143166Z"},"content_sha256":"afa53a32ae0b78b1bdcf66b52d57491bbabd0133b0743621dd023681c97938f0","schema_version":"1.0","event_id":"sha256:afa53a32ae0b78b1bdcf66b52d57491bbabd0133b0743621dd023681c97938f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2LUYNEQ4QXESKIHZF7NUOE3PVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the exact minimization of saturated loss functions for robust regression and subspace estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Fabien Lauer (ABC)","submitted_at":"2018-06-15T07:24:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05833","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mj0gG4ohK7poLMCqsNTYWnJRVx0ire7YAdpkecPMAVnwXdUsRsIpCVEVLHIxqrKpBevZEM6bODT/Ix7bPR5WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T17:31:57.143525Z"},"content_sha256":"0467c61ac08c2815ce94b59780a9548f8848bfc8e470b35300222305804388f2","schema_version":"1.0","event_id":"sha256:0467c61ac08c2815ce94b59780a9548f8848bfc8e470b35300222305804388f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/bundle.json","state_url":"https://pith.science/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T17:31:57Z","links":{"resolver":"https://pith.science/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW","bundle":"https://pith.science/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/bundle.json","state":"https://pith.science/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LUYNEQ4QXESKIHZF7NUOE3PVW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PWPxz79tV2+tYQxtv0VO1nG9TYzXWFeC7gUQPthWT8L5Kw5pjPgYJPnA+qYLgbWlWdDInBRwUtBr5ax5mGcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T17:31:57.145472Z","bundle_sha256":"ccb65163141219a0119105d9506602927267fcf9d63584551bf361c4faf1621c"}}