{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VQEP6RW4M7BGPAJTSIK5N3XWLH","short_pith_number":"pith:VQEP6RW4","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"},"canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","source":{"kind":"arxiv","id":"2412.04855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.04855","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"2412.04855v1","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04855","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"VQEP6RW4M7BG","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_16","alias_value":"VQEP6RW4M7BGPAJT","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_8","alias_value":"VQEP6RW4","created_at":"2026-07-05T09:45:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VQEP6RW4M7BGPAJTSIK5N3XWLH","target":"record","payload":{"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"},"canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","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"},"source_kind":"arxiv","source_id":"2412.04855","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekHZnhWhBBDkW81rH7yoR0Cg8tVFPwT2s0Qmulc1kayUsWAkQsA3oRL0TLcNzlkw6h4Vzbo8zu2xh50hbNGNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:41:50.120851Z"},"content_sha256":"377ceaba29a2b500b8f5d1ae52e381aae49818c01931b2b23de0a01f2004e2cc","schema_version":"1.0","event_id":"sha256:377ceaba29a2b500b8f5d1ae52e381aae49818c01931b2b23de0a01f2004e2cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VQEP6RW4M7BGPAJTSIK5N3XWLH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:45:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RnMkjIvBT/pf+YnfOotoGSOYGtEHrG68xBj8YcGn9XM7P1ICg6e6HvifNFWdzJEApUSWxXYpQ6AHvRyjRYVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T08:41:50.121820Z"},"content_sha256":"dab507e5e45f5e2774197c6b0cbb8f4f2e55861c0e3454053b596502916fe131","schema_version":"1.0","event_id":"sha256:dab507e5e45f5e2774197c6b0cbb8f4f2e55861c0e3454053b596502916fe131"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/bundle.json","state_url":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T08:41:50Z","links":{"resolver":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH","bundle":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/bundle.json","state":"https://pith.science/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQEP6RW4M7BGPAJTSIK5N3XWLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VQEP6RW4M7BGPAJTSIK5N3XWLH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c3e99c46b54dc9ce92447accac15b1edf4e2f9350408c9754de2a0fce143d525","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-06T08:47:14Z","title_canon_sha256":"5eedd55b6f7cb57abd9675ef23d45b49f7ba61b498de213df9dd041c1aeca8ed"},"schema_version":"1.0","source":{"id":"2412.04855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.04855","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"arxiv_version","alias_value":"2412.04855v1","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04855","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_12","alias_value":"VQEP6RW4M7BG","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_16","alias_value":"VQEP6RW4M7BGPAJT","created_at":"2026-07-05T09:45:24Z"},{"alias_kind":"pith_short_8","alias_value":"VQEP6RW4","created_at":"2026-07-05T09:45:24Z"}],"graph_snapshots":[{"event_id":"sha256:dab507e5e45f5e2774197c6b0cbb8f4f2e55861c0e3454053b596502916fe131","target":"graph","created_at":"2026-07-05T09:45:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.04855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Tianlun Huang, Wei Feng, Weijun Wang, Yaojie Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-06T08:47:14Z","title":"GS-Matching: Reconsidering Feature Matching task in Point Cloud Registration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04855","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:377ceaba29a2b500b8f5d1ae52e381aae49818c01931b2b23de0a01f2004e2cc","target":"record","created_at":"2026-07-05T09:45:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c3e99c46b54dc9ce92447accac15b1edf4e2f9350408c9754de2a0fce143d525","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-12-06T08:47:14Z","title_canon_sha256":"5eedd55b6f7cb57abd9675ef23d45b49f7ba61b498de213df9dd041c1aeca8ed"},"schema_version":"1.0","source":{"id":"2412.04855","kind":"arxiv","version":1}},"canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac08ff46dc67c26781339215d6eef659db1deda540b0ded9ee6494de8b247d9e","first_computed_at":"2026-07-05T09:45:24.828167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:45:24.828167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1DJs3tCG0vRYKN1/mkcQmhoEBXqiiR3pfn3GIPI/xsMQV6wCwqOKjVnyCrAK0bAmuWP7sN+hhdXmq1piHP/Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:45:24.828667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.04855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:377ceaba29a2b500b8f5d1ae52e381aae49818c01931b2b23de0a01f2004e2cc","sha256:dab507e5e45f5e2774197c6b0cbb8f4f2e55861c0e3454053b596502916fe131"],"state_sha256":"871a691fc90c1ea65c76fb439d7a5c801efff667b2267dfc8d1d21d6207cbf7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"syBiyQ8WoMG31mFaQL2wyKwLWF2ITVT+6iLDGu4696U6ZdrL73AFDoN8ThBdPP7vl/gB/Q6ZTKy3Nv9/Yj1hBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T08:41:50.188679Z","bundle_sha256":"8301af2393203e57a6267fc8a3edbbe2a789edf728fb1e9c18b8bb92f497d85f"}}