{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2WTZL2O4RW2LYHFWCPPNYXL7EH","short_pith_number":"pith:2WTZL2O4","schema_version":"1.0","canonical_sha256":"d5a795e9dc8db4bc1cb613dedc5d7f21e8250e8dd644ef603dab92e9b82637a4","source":{"kind":"arxiv","id":"1909.08605","version":4},"attestation_state":"computed","paper":{"title":"Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.OC"],"primary_cat":"cs.CV","authors_text":"Heng Yang, Luca Carlone, Pasquale Antonante, Vasileios Tzoumas","submitted_at":"2019-09-18T17:50:04Z","abstract_excerpt":"Semidefinite Programming (SDP) and Sums-of-Squares (SOS) relaxations have led to certifiably optimal non-minimal solvers for several robotics and computer vision problems. However, most non-minimal solvers rely on least-squares formulations, and, as a result, are brittle against outliers. While a standard approach to regain robustness against outliers is to use robust cost functions, the latter typically introduce other non-convexities, preventing the use of existing non-minimal solvers. In this paper, we enable the simultaneous use of non-minimal solvers and robust estimation by providing a g"},"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":"1909.08605","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-18T17:50:04Z","cross_cats_sorted":["cs.RO","math.OC"],"title_canon_sha256":"65f7cbc8ffd966a757f64e1426e2dcfd923bc5bc58871eaf459e2631907d18d1","abstract_canon_sha256":"2ecccf0b58327271219a7413f5b7818308d02ef78d40dc05d3498abdcbadd65c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:39.061928Z","signature_b64":"FKGFEGTP/7iwI2D+wcJR5SJrwih8jVAioS2fWEYWafNyr948LipcjX8RjjLGPI+OKVlDxY0/02pQ8j4AtOPABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5a795e9dc8db4bc1cb613dedc5d7f21e8250e8dd644ef603dab92e9b82637a4","last_reissued_at":"2026-07-05T01:09:39.061408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:39.061408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graduated Non-Convexity for Robust Spatial Perception: From Non-Minimal Solvers to Global Outlier Rejection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","math.OC"],"primary_cat":"cs.CV","authors_text":"Heng Yang, Luca Carlone, Pasquale Antonante, Vasileios Tzoumas","submitted_at":"2019-09-18T17:50:04Z","abstract_excerpt":"Semidefinite Programming (SDP) and Sums-of-Squares (SOS) relaxations have led to certifiably optimal non-minimal solvers for several robotics and computer vision problems. However, most non-minimal solvers rely on least-squares formulations, and, as a result, are brittle against outliers. While a standard approach to regain robustness against outliers is to use robust cost functions, the latter typically introduce other non-convexities, preventing the use of existing non-minimal solvers. In this paper, we enable the simultaneous use of non-minimal solvers and robust estimation by providing a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.08605","kind":"arxiv","version":4},"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/1909.08605/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":"1909.08605","created_at":"2026-07-05T01:09:39.061468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.08605v4","created_at":"2026-07-05T01:09:39.061468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.08605","created_at":"2026-07-05T01:09:39.061468+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WTZL2O4RW2L","created_at":"2026-07-05T01:09:39.061468+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WTZL2O4RW2LYHFW","created_at":"2026-07-05T01:09:39.061468+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WTZL2O4","created_at":"2026-07-05T01:09:39.061468+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":90,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH","json":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH.json","graph_json":"https://pith.science/api/pith-number/2WTZL2O4RW2LYHFWCPPNYXL7EH/graph.json","events_json":"https://pith.science/api/pith-number/2WTZL2O4RW2LYHFWCPPNYXL7EH/events.json","paper":"https://pith.science/paper/2WTZL2O4"},"agent_actions":{"view_html":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH","download_json":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH.json","view_paper":"https://pith.science/paper/2WTZL2O4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.08605&json=true","fetch_graph":"https://pith.science/api/pith-number/2WTZL2O4RW2LYHFWCPPNYXL7EH/graph.json","fetch_events":"https://pith.science/api/pith-number/2WTZL2O4RW2LYHFWCPPNYXL7EH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH/action/storage_attestation","attest_author":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH/action/author_attestation","sign_citation":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH/action/citation_signature","submit_replication":"https://pith.science/pith/2WTZL2O4RW2LYHFWCPPNYXL7EH/action/replication_record"}},"created_at":"2026-07-05T01:09:39.061468+00:00","updated_at":"2026-07-05T01:09:39.061468+00:00"}