{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7BGVHBCLQV7UXIY45UDVE65OA2","short_pith_number":"pith:7BGVHBCL","schema_version":"1.0","canonical_sha256":"f84d53844b857f4ba31ced07527bae06a41cadccff840b35cf9b360496361798","source":{"kind":"arxiv","id":"2409.15615","version":3},"attestation_state":"computed","paper":{"title":"KISS-Matcher: Fast and Robust Point Cloud Registration Revisited","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Daebeom Kim, Gunhee Shin, Hyungtae Lim, Hyun Myung, Ignacio Vizzo, Jaesik Park, Jingnan Shi, Luca Carlone","submitted_at":"2024-09-23T23:39:03Z","abstract_excerpt":"While global point cloud registration systems have advanced significantly in all aspects, many studies have focused on specific components, such as feature extraction, graph-theoretic pruning, or pose solvers. In this paper, we take a holistic view on the registration problem and develop an open-source and versatile C++ library for point cloud registration, called KISS-Matcher. KISS-Matcher combines a novel feature detector, Faster-PFH, that improves over the classical fast point feature histogram (FPFH). Moreover, it adopts a $k$-core-based graph-theoretic pruning to reduce the time complexit"},"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":"2409.15615","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2024-09-23T23:39:03Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"159174fc938deb55499eba74528a01510856055f0fd48da58c25f98de5eee936","abstract_canon_sha256":"cd0cfcbd0dfb66bbb97a698f0b88b21d6d935506212eb1df3623c439c2994262"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:42.501753Z","signature_b64":"9yEJrNzj9ePX9OaTVLuiWN6i1uyRJx0Kkq+s5QNbV5kgxDJFi4XTOLl6KmN2aDvmK9MZb+rVUXpQud+9rVwICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84d53844b857f4ba31ced07527bae06a41cadccff840b35cf9b360496361798","last_reissued_at":"2026-07-05T11:37:42.501122Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:42.501122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KISS-Matcher: Fast and Robust Point Cloud Registration Revisited","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CV","authors_text":"Daebeom Kim, Gunhee Shin, Hyungtae Lim, Hyun Myung, Ignacio Vizzo, Jaesik Park, Jingnan Shi, Luca Carlone","submitted_at":"2024-09-23T23:39:03Z","abstract_excerpt":"While global point cloud registration systems have advanced significantly in all aspects, many studies have focused on specific components, such as feature extraction, graph-theoretic pruning, or pose solvers. In this paper, we take a holistic view on the registration problem and develop an open-source and versatile C++ library for point cloud registration, called KISS-Matcher. KISS-Matcher combines a novel feature detector, Faster-PFH, that improves over the classical fast point feature histogram (FPFH). Moreover, it adopts a $k$-core-based graph-theoretic pruning to reduce the time complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15615","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/2409.15615/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":"2409.15615","created_at":"2026-07-05T11:37:42.501196+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15615v3","created_at":"2026-07-05T11:37:42.501196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15615","created_at":"2026-07-05T11:37:42.501196+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BGVHBCLQV7U","created_at":"2026-07-05T11:37:42.501196+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BGVHBCLQV7UXIY4","created_at":"2026-07-05T11:37:42.501196+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BGVHBCL","created_at":"2026-07-05T11:37:42.501196+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25386","citing_title":"Commerge: Communication-Efficient, Robust, and Fast LiDAR Map Merging Framework for Multi-Robot Coordination in Resource-Constrained Scenarios","ref_index":50,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2","json":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2.json","graph_json":"https://pith.science/api/pith-number/7BGVHBCLQV7UXIY45UDVE65OA2/graph.json","events_json":"https://pith.science/api/pith-number/7BGVHBCLQV7UXIY45UDVE65OA2/events.json","paper":"https://pith.science/paper/7BGVHBCL"},"agent_actions":{"view_html":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2","download_json":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2.json","view_paper":"https://pith.science/paper/7BGVHBCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15615&json=true","fetch_graph":"https://pith.science/api/pith-number/7BGVHBCLQV7UXIY45UDVE65OA2/graph.json","fetch_events":"https://pith.science/api/pith-number/7BGVHBCLQV7UXIY45UDVE65OA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2/action/storage_attestation","attest_author":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2/action/author_attestation","sign_citation":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2/action/citation_signature","submit_replication":"https://pith.science/pith/7BGVHBCLQV7UXIY45UDVE65OA2/action/replication_record"}},"created_at":"2026-07-05T11:37:42.501196+00:00","updated_at":"2026-07-05T11:37:42.501196+00:00"}