{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TKBZYNQEZV3WZZM5B3IEHR43OR","short_pith_number":"pith:TKBZYNQE","schema_version":"1.0","canonical_sha256":"9a839c3604cd776ce59d0ed043c79b744c0f6e9ae73982d8e36191219c5ed633","source":{"kind":"arxiv","id":"2502.02163","version":2},"attestation_state":"computed","paper":{"title":"Progressive Correspondence Regenerator for Robust 3D Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guiyu Zhao, Kai Xu, Sheng Ao, Ye Zhang, Yulan Guo","submitted_at":"2025-02-04T09:38:45Z","abstract_excerpt":"Obtaining enough high-quality correspondences is crucial for robust registration. Existing correspondence refinement methods mostly follow the paradigm of outlier removal, which either fails to correctly identify the accurate correspondences under extreme outlier ratios, or select too few correct correspondences to support robust registration. To address this challenge, we propose a novel approach named Regor, which is a progressive correspondence regenerator that generates higher-quality matches whist sufficiently robust for numerous outliers. In each iteration, we first apply prior-guided lo"},"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":"2502.02163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-02-04T09:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"89c79b87330015155eda7859a265d8b8315ffcc6c2f6c50ed3fe8c9f895c99e6","abstract_canon_sha256":"f5c48ae7653fd2a1efd73d01f41346d3a0f065e52b2dcad2dbe31757740ef8c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:11:33.106498Z","signature_b64":"p2dcAjmOgOPecNPUXO+hZ1JehH37yPOMxrEYYWh/REioq61a8mq5XrpbvlRfl4uLS2CfqqssCUjPhYJxn0msCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a839c3604cd776ce59d0ed043c79b744c0f6e9ae73982d8e36191219c5ed633","last_reissued_at":"2026-07-05T10:11:33.106001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:11:33.106001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progressive Correspondence Regenerator for Robust 3D Registration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guiyu Zhao, Kai Xu, Sheng Ao, Ye Zhang, Yulan Guo","submitted_at":"2025-02-04T09:38:45Z","abstract_excerpt":"Obtaining enough high-quality correspondences is crucial for robust registration. Existing correspondence refinement methods mostly follow the paradigm of outlier removal, which either fails to correctly identify the accurate correspondences under extreme outlier ratios, or select too few correct correspondences to support robust registration. To address this challenge, we propose a novel approach named Regor, which is a progressive correspondence regenerator that generates higher-quality matches whist sufficiently robust for numerous outliers. In each iteration, we first apply prior-guided lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02163","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/2502.02163/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":"2502.02163","created_at":"2026-07-05T10:11:33.106059+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02163v2","created_at":"2026-07-05T10:11:33.106059+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02163","created_at":"2026-07-05T10:11:33.106059+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKBZYNQEZV3W","created_at":"2026-07-05T10:11:33.106059+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKBZYNQEZV3WZZM5","created_at":"2026-07-05T10:11:33.106059+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKBZYNQE","created_at":"2026-07-05T10:11:33.106059+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR","json":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR.json","graph_json":"https://pith.science/api/pith-number/TKBZYNQEZV3WZZM5B3IEHR43OR/graph.json","events_json":"https://pith.science/api/pith-number/TKBZYNQEZV3WZZM5B3IEHR43OR/events.json","paper":"https://pith.science/paper/TKBZYNQE"},"agent_actions":{"view_html":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR","download_json":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR.json","view_paper":"https://pith.science/paper/TKBZYNQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02163&json=true","fetch_graph":"https://pith.science/api/pith-number/TKBZYNQEZV3WZZM5B3IEHR43OR/graph.json","fetch_events":"https://pith.science/api/pith-number/TKBZYNQEZV3WZZM5B3IEHR43OR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR/action/storage_attestation","attest_author":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR/action/author_attestation","sign_citation":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR/action/citation_signature","submit_replication":"https://pith.science/pith/TKBZYNQEZV3WZZM5B3IEHR43OR/action/replication_record"}},"created_at":"2026-07-05T10:11:33.106059+00:00","updated_at":"2026-07-05T10:11:33.106059+00:00"}