{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7SDVY3OJMHML3VMLP6DU6TALNC","short_pith_number":"pith:7SDVY3OJ","schema_version":"1.0","canonical_sha256":"fc875c6dc961d8bdd58b7f874f4c0b68a1971334694139937c8dfcc9c391dece","source":{"kind":"arxiv","id":"2001.07715","version":2},"attestation_state":"computed","paper":{"title":"TEASER: Fast and Certifiable Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.RO","authors_text":"Heng Yang, Jingnan Shi, Luca Carlone","submitted_at":"2020-01-21T18:56:00Z","abstract_excerpt":"We propose the first fast and certifiable algorithm for the registration of two sets of 3D points in the presence of large amounts of outlier correspondences. We first reformulate the registration problem using a Truncated Least Squares (TLS) cost that is insensitive to a large fraction of spurious correspondences. Then, we provide a general graph-theoretic framework to decouple scale, rotation, and translation estimation, which allows solving in cascade for the three transformations. Despite the fact that each subproblem is still non-convex and combinatorial in nature, we show that (i) TLS sc"},"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":"2001.07715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-01-21T18:56:00Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"2268eee3bc9080cca3ec2cf14bb9d6a1bc33763d560b83096e4878e6d21db0e8","abstract_canon_sha256":"95cc73b01adf8630cf513f8d5e02f7ce23d989885c92e331014a58022b4b7f4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:38.999407Z","signature_b64":"UmHNCQPfPKpG3u29PWQ0nzsO9rcYX93JNZU2wUk0budvGsHB+pXL+neGB3kAeWcmL3c3Q9oO9xVO+IzUEWQOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc875c6dc961d8bdd58b7f874f4c0b68a1971334694139937c8dfcc9c391dece","last_reissued_at":"2026-07-05T01:43:38.998870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:38.998870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TEASER: Fast and Certifiable Point Cloud Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.RO","authors_text":"Heng Yang, Jingnan Shi, Luca Carlone","submitted_at":"2020-01-21T18:56:00Z","abstract_excerpt":"We propose the first fast and certifiable algorithm for the registration of two sets of 3D points in the presence of large amounts of outlier correspondences. We first reformulate the registration problem using a Truncated Least Squares (TLS) cost that is insensitive to a large fraction of spurious correspondences. Then, we provide a general graph-theoretic framework to decouple scale, rotation, and translation estimation, which allows solving in cascade for the three transformations. Despite the fact that each subproblem is still non-convex and combinatorial in nature, we show that (i) TLS sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.07715","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.07715/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":"2001.07715","created_at":"2026-07-05T01:43:38.998930+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.07715v2","created_at":"2026-07-05T01:43:38.998930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.07715","created_at":"2026-07-05T01:43:38.998930+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SDVY3OJMHML","created_at":"2026-07-05T01:43:38.998930+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SDVY3OJMHML3VML","created_at":"2026-07-05T01:43:38.998930+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SDVY3OJ","created_at":"2026-07-05T01:43:38.998930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31100","citing_title":"Vector Linking via Cross-Model Local Isometric Consistency","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2008.01574","citing_title":"A Robust 3D Registration Method via Simultaneous Inlier Identification and Model Estimation","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2412.02818","citing_title":"RoboMD: Uncovering Robot Vulnerabilities through Semantic Potential Fields","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2602.08058","citing_title":"Picasso: Holistic Scene Reconstruction with Physics-Constrained Sampling","ref_index":55,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC","json":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC.json","graph_json":"https://pith.science/api/pith-number/7SDVY3OJMHML3VMLP6DU6TALNC/graph.json","events_json":"https://pith.science/api/pith-number/7SDVY3OJMHML3VMLP6DU6TALNC/events.json","paper":"https://pith.science/paper/7SDVY3OJ"},"agent_actions":{"view_html":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC","download_json":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC.json","view_paper":"https://pith.science/paper/7SDVY3OJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.07715&json=true","fetch_graph":"https://pith.science/api/pith-number/7SDVY3OJMHML3VMLP6DU6TALNC/graph.json","fetch_events":"https://pith.science/api/pith-number/7SDVY3OJMHML3VMLP6DU6TALNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC/action/storage_attestation","attest_author":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC/action/author_attestation","sign_citation":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC/action/citation_signature","submit_replication":"https://pith.science/pith/7SDVY3OJMHML3VMLP6DU6TALNC/action/replication_record"}},"created_at":"2026-07-05T01:43:38.998930+00:00","updated_at":"2026-07-05T01:43:38.998930+00:00"}