{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CBWD32VXMLI6TZZCQXS53COLXC","short_pith_number":"pith:CBWD32VX","schema_version":"1.0","canonical_sha256":"106c3deab762d1e9e72285e5dd89cbb8bf976a23ab342e47b14b7102f8de67b2","source":{"kind":"arxiv","id":"2007.15109","version":3},"attestation_state":"computed","paper":{"title":"Outlier-Robust Estimation: Hardness, Minimally Tuned Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Heng Yang, Luca Carlone, Pasquale Antonante, Vasileios Tzoumas","submitted_at":"2020-07-29T21:06:13Z","abstract_excerpt":"Nonlinear estimation in robotics and vision is typically plagued with outliers due to wrong data association, or to incorrect detections from signal processing and machine learning methods. This paper introduces two unifying formulations for outlier-robust estimation, Generalized Maximum Consensus (G-MC) and Generalized Truncated Least Squares (G-TLS), and investigates fundamental limits, practical algorithms, and applications. Our first contribution is a proof that outlier-robust estimation is inapproximable: in the worst case, it is impossible to (even approximately) find the set of outliers"},"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":"2007.15109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-07-29T21:06:13Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"99d1185e53e5b21b22add0c24d75faa2307a6810b28c972dd2ecf1c6ef433ad8","abstract_canon_sha256":"ee49dd576e083eae939f4642c36f349764438e5698c27b8e0e5ea3cda914e056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:28.712885Z","signature_b64":"czpULsP/RUK12cKoqPn6+JKj0x9mGGahTdFh8HluuVbHd5nTI2531M1z8T9an18ImxfI5LePY3fQca/slfZkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"106c3deab762d1e9e72285e5dd89cbb8bf976a23ab342e47b14b7102f8de67b2","last_reissued_at":"2026-07-05T02:54:28.712491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:28.712491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Outlier-Robust Estimation: Hardness, Minimally Tuned Algorithms, and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Heng Yang, Luca Carlone, Pasquale Antonante, Vasileios Tzoumas","submitted_at":"2020-07-29T21:06:13Z","abstract_excerpt":"Nonlinear estimation in robotics and vision is typically plagued with outliers due to wrong data association, or to incorrect detections from signal processing and machine learning methods. This paper introduces two unifying formulations for outlier-robust estimation, Generalized Maximum Consensus (G-MC) and Generalized Truncated Least Squares (G-TLS), and investigates fundamental limits, practical algorithms, and applications. Our first contribution is a proof that outlier-robust estimation is inapproximable: in the worst case, it is impossible to (even approximately) find the set of outliers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15109","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.15109/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.15109","created_at":"2026-07-05T02:54:28.712547+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.15109v3","created_at":"2026-07-05T02:54:28.712547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15109","created_at":"2026-07-05T02:54:28.712547+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBWD32VXMLI6","created_at":"2026-07-05T02:54:28.712547+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBWD32VXMLI6TZZC","created_at":"2026-07-05T02:54:28.712547+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBWD32VX","created_at":"2026-07-05T02:54:28.712547+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.00265","citing_title":"Outlier-Robust Training of Machine Learning Models","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC","json":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC.json","graph_json":"https://pith.science/api/pith-number/CBWD32VXMLI6TZZCQXS53COLXC/graph.json","events_json":"https://pith.science/api/pith-number/CBWD32VXMLI6TZZCQXS53COLXC/events.json","paper":"https://pith.science/paper/CBWD32VX"},"agent_actions":{"view_html":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC","download_json":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC.json","view_paper":"https://pith.science/paper/CBWD32VX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.15109&json=true","fetch_graph":"https://pith.science/api/pith-number/CBWD32VXMLI6TZZCQXS53COLXC/graph.json","fetch_events":"https://pith.science/api/pith-number/CBWD32VXMLI6TZZCQXS53COLXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC/action/storage_attestation","attest_author":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC/action/author_attestation","sign_citation":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC/action/citation_signature","submit_replication":"https://pith.science/pith/CBWD32VXMLI6TZZCQXS53COLXC/action/replication_record"}},"created_at":"2026-07-05T02:54:28.712547+00:00","updated_at":"2026-07-05T02:54:28.712547+00:00"}