{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FS34WDIJQ63ZORFYOU6I67DTGB","short_pith_number":"pith:FS34WDIJ","schema_version":"1.0","canonical_sha256":"2cb7cb0d0987b79744b8753c8f7c733074df713ef4b4717fbe9406fe5b6375e5","source":{"kind":"arxiv","id":"2004.08772","version":3},"attestation_state":"computed","paper":{"title":"Maximizing robustness of point-set registration by leveraging non-convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cindy Orozco Bohorquez, Lexing Ying, YueHaw Khoo","submitted_at":"2020-04-19T05:40:59Z","abstract_excerpt":"Point-set registration is a classical image processing problem that looks for the optimal transformation between two sets of points. In this work, we analyze the impact of outliers when finding the optimal rotation between two point clouds. The presence of outliers motivates the use of least unsquared deviation, which is a non-smooth minimization problem over non-convex domain. We compare approaches based on non-convex optimization over special orthogonal group and convex relaxations. We show that if the fraction of outliers is larger than a certain threshold, any naive convex relaxation fails"},"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":"2004.08772","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-04-19T05:40:59Z","cross_cats_sorted":[],"title_canon_sha256":"a07c60d505ff9ba617dce3556b5d0c1f2c9f50bd86e4516611c7839a64b7d0c6","abstract_canon_sha256":"cc62ba6cceb8007c998c8171b9eb6ec83394fc8426d2380f849686c4fac23555"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:17.689474Z","signature_b64":"5ZjySwiQaaNgk8tNOdGHGEQ7HEeKbE95NOyn2CPEw887TTxJBbnZWDBwHyjZkFv9ni/m16YPDt5kPPUHTLwLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cb7cb0d0987b79744b8753c8f7c733074df713ef4b4717fbe9406fe5b6375e5","last_reissued_at":"2026-07-05T01:41:17.688909Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:17.688909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing robustness of point-set registration by leveraging non-convexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Cindy Orozco Bohorquez, Lexing Ying, YueHaw Khoo","submitted_at":"2020-04-19T05:40:59Z","abstract_excerpt":"Point-set registration is a classical image processing problem that looks for the optimal transformation between two sets of points. In this work, we analyze the impact of outliers when finding the optimal rotation between two point clouds. The presence of outliers motivates the use of least unsquared deviation, which is a non-smooth minimization problem over non-convex domain. We compare approaches based on non-convex optimization over special orthogonal group and convex relaxations. We show that if the fraction of outliers is larger than a certain threshold, any naive convex relaxation fails"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08772","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/2004.08772/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":"2004.08772","created_at":"2026-07-05T01:41:17.688975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.08772v3","created_at":"2026-07-05T01:41:17.688975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08772","created_at":"2026-07-05T01:41:17.688975+00:00"},{"alias_kind":"pith_short_12","alias_value":"FS34WDIJQ63Z","created_at":"2026-07-05T01:41:17.688975+00:00"},{"alias_kind":"pith_short_16","alias_value":"FS34WDIJQ63ZORFY","created_at":"2026-07-05T01:41:17.688975+00:00"},{"alias_kind":"pith_short_8","alias_value":"FS34WDIJ","created_at":"2026-07-05T01:41:17.688975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14444","citing_title":"Inlier Recovery for Robust Registration via Gram-Matrix Overlap","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB","json":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB.json","graph_json":"https://pith.science/api/pith-number/FS34WDIJQ63ZORFYOU6I67DTGB/graph.json","events_json":"https://pith.science/api/pith-number/FS34WDIJQ63ZORFYOU6I67DTGB/events.json","paper":"https://pith.science/paper/FS34WDIJ"},"agent_actions":{"view_html":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB","download_json":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB.json","view_paper":"https://pith.science/paper/FS34WDIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.08772&json=true","fetch_graph":"https://pith.science/api/pith-number/FS34WDIJQ63ZORFYOU6I67DTGB/graph.json","fetch_events":"https://pith.science/api/pith-number/FS34WDIJQ63ZORFYOU6I67DTGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB/action/storage_attestation","attest_author":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB/action/author_attestation","sign_citation":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB/action/citation_signature","submit_replication":"https://pith.science/pith/FS34WDIJQ63ZORFYOU6I67DTGB/action/replication_record"}},"created_at":"2026-07-05T01:41:17.688975+00:00","updated_at":"2026-07-05T01:41:17.688975+00:00"}