{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VQEP6RW4M7BGPAJTSIK5N3XWLH","short_pith_number":"pith:VQEP6RW4","schema_version":"1.0","canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","source":{"kind":"arxiv","id":"2412.04855","version":1},"attestation_state":"computed","paper":{"title":"GS-Matching: Reconsidering Feature Matching task in Point Cloud Registration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tianlun Huang, Wei Feng, Weijun Wang, Yaojie Zhang","submitted_at":"2024-12-06T08:47:14Z","abstract_excerpt":"Traditional point cloud registration (PCR) methods for feature matching often employ the nearest neighbor policy. This leads to many-to-one matches and numerous potential inliers without any corresponding point. Recently, some approaches have framed the feature matching task as an assignment problem to achieve optimal one-to-one matches. We argue that the transition to the Assignment problem is not reliable for general correspondence-based PCR. In this paper, we propose a heuristics stable matching policy called GS-matching, inspired by the Gale-Shapley algorithm. Compared to the other matchin"},"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":"2412.04855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-06T08:47:14Z","cross_cats_sorted":[],"title_canon_sha256":"5eedd55b6f7cb57abd9675ef23d45b49f7ba61b498de213df9dd041c1aeca8ed","abstract_canon_sha256":"c3e99c46b54dc9ce92447accac15b1edf4e2f9350408c9754de2a0fce143d525"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:24.828667Z","signature_b64":"G1DJs3tCG0vRYKN1/mkcQmhoEBXqiiR3pfn3GIPI/xsMQV6wCwqOKjVnyCrAK0bAmuWP7sN+hhdXmq1piHP/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","last_reissued_at":"2026-07-05T09:45:24.828167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:24.828167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GS-Matching: Reconsidering Feature Matching task in Point Cloud Registration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Tianlun Huang, Wei Feng, Weijun Wang, Yaojie Zhang","submitted_at":"2024-12-06T08:47:14Z","abstract_excerpt":"Traditional point cloud registration (PCR) methods for feature matching often employ the nearest neighbor policy. This leads to many-to-one matches and numerous potential inliers without any corresponding point. Recently, some approaches have framed the feature matching task as an assignment problem to achieve optimal one-to-one matches. We argue that the transition to the Assignment problem is not reliable for general correspondence-based PCR. In this paper, we propose a heuristics stable matching policy called GS-matching, inspired by the Gale-Shapley algorithm. Compared to the other matchin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04855","kind":"arxiv","version":1},"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/2412.04855/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":"2412.04855","created_at":"2026-07-05T09:45:24.828229+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04855v1","created_at":"2026-07-05T09:45:24.828229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04855","created_at":"2026-07-05T09:45:24.828229+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQEP6RW4M7BG","created_at":"2026-07-05T09:45:24.828229+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQEP6RW4M7BGPAJT","created_at":"2026-07-05T09:45:24.828229+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQEP6RW4","created_at":"2026-07-05T09:45:24.828229+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/VQEP6RW4M7BGPAJTSIK5N3XWLH","json":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH.json","graph_json":"https://pith.science/api/pith-number/VQEP6RW4M7BGPAJTSIK5N3XWLH/graph.json","events_json":"https://pith.science/api/pith-number/VQEP6RW4M7BGPAJTSIK5N3XWLH/events.json","paper":"https://pith.science/paper/VQEP6RW4"},"agent_actions":{"view_html":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH","download_json":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH.json","view_paper":"https://pith.science/paper/VQEP6RW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04855&json=true","fetch_graph":"https://pith.science/api/pith-number/VQEP6RW4M7BGPAJTSIK5N3XWLH/graph.json","fetch_events":"https://pith.science/api/pith-number/VQEP6RW4M7BGPAJTSIK5N3XWLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/action/storage_attestation","attest_author":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/action/author_attestation","sign_citation":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/action/citation_signature","submit_replication":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/action/replication_record"}},"created_at":"2026-07-05T09:45:24.828229+00:00","updated_at":"2026-07-05T09:45:24.828229+00:00"}