{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:7MXWSR4BZVPPB35TMJ7ZQELCGF","short_pith_number":"pith:7MXWSR4B","canonical_record":{"source":{"id":"2003.13479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-30T13:45:27Z","cross_cats_sorted":[],"title_canon_sha256":"dd805f17f28a520bf1b325205bcff0fee8a9fdb506e912c8d6c3ea38f39cf624","abstract_canon_sha256":"a3ed467a887d0fdefcfb0c0e9bbc988017476b5bc248747b4c504afaca405bf3"},"schema_version":"1.0"},"canonical_sha256":"fb2f694781cd5ef0efb3627f981162316379f7f4262e651a154ba9dd6ac25c5f","source":{"kind":"arxiv","id":"2003.13479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13479","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13479v1","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13479","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_12","alias_value":"7MXWSR4BZVPP","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"7MXWSR4BZVPPB35T","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"7MXWSR4B","created_at":"2026-07-05T02:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:7MXWSR4BZVPPB35TMJ7ZQELCGF","target":"record","payload":{"canonical_record":{"source":{"id":"2003.13479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-30T13:45:27Z","cross_cats_sorted":[],"title_canon_sha256":"dd805f17f28a520bf1b325205bcff0fee8a9fdb506e912c8d6c3ea38f39cf624","abstract_canon_sha256":"a3ed467a887d0fdefcfb0c0e9bbc988017476b5bc248747b4c504afaca405bf3"},"schema_version":"1.0"},"canonical_sha256":"fb2f694781cd5ef0efb3627f981162316379f7f4262e651a154ba9dd6ac25c5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:26.249464Z","signature_b64":"CvTbOQEMEL6oVZLbGhGeTD1ROdxA1KXfmNm1CHF4t2KdtPDFOmPOZrWYdSpat7Stc9eDtwzdA1a7WqmSeeXQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb2f694781cd5ef0efb3627f981162316379f7f4262e651a154ba9dd6ac25c5f","last_reissued_at":"2026-07-05T02:26:26.248964Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:26.248964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.13479","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-05T02:26:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgBXvx/Sn6SryNWSxRyajSkh0TgI3et7VijU8ms1OJndAoMXBlMBPwrY+HNG3fVvqSWkHUGXvwyjGMHGn4LuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:44:31.311116Z"},"content_sha256":"550459f4b8cb1e9c81ef67f384991d7cc1c691151d634721e1a81ff468d17eba","schema_version":"1.0","event_id":"sha256:550459f4b8cb1e9c81ef67f384991d7cc1c691151d634721e1a81ff468d17eba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:7MXWSR4BZVPPB35TMJ7ZQELCGF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RPM-Net: Robust Point Matching using Learned Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gim Hee Lee, Zi Jian Yew","submitted_at":"2020-03-30T13:45:27Z","abstract_excerpt":"Iterative Closest Point (ICP) solves the rigid point cloud registration problem iteratively in two steps: (1) make hard assignments of spatially closest point correspondences, and then (2) find the least-squares rigid transformation. The hard assignments of closest point correspondences based on spatial distances are sensitive to the initial rigid transformation and noisy/outlier points, which often cause ICP to converge to wrong local minima. In this paper, we propose the RPM-Net -- a less sensitive to initialization and more robust deep learning-based approach for rigid point cloud registrat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13479","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/2003.13479/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-05T02:26:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tE6+EMX0Dq6oEI7RUh82QD90Uc7k79HUdMpF/y2zCGA+TCBw9/8xz9ZmqiZp6BIZhUPt5I3VPIk00yhmP+9sAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T11:44:31.311554Z"},"content_sha256":"22c1db1a4dc91eb157dc54d1b9d87386358c80e7083b381850997396e6295f11","schema_version":"1.0","event_id":"sha256:22c1db1a4dc91eb157dc54d1b9d87386358c80e7083b381850997396e6295f11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/bundle.json","state_url":"https://pith.science/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/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-07-05T11:44:31Z","links":{"resolver":"https://pith.science/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF","bundle":"https://pith.science/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/bundle.json","state":"https://pith.science/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MXWSR4BZVPPB35TMJ7ZQELCGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:7MXWSR4BZVPPB35TMJ7ZQELCGF","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":"a3ed467a887d0fdefcfb0c0e9bbc988017476b5bc248747b4c504afaca405bf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-30T13:45:27Z","title_canon_sha256":"dd805f17f28a520bf1b325205bcff0fee8a9fdb506e912c8d6c3ea38f39cf624"},"schema_version":"1.0","source":{"id":"2003.13479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.13479","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"arxiv_version","alias_value":"2003.13479v1","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.13479","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_12","alias_value":"7MXWSR4BZVPP","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"7MXWSR4BZVPPB35T","created_at":"2026-07-05T02:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"7MXWSR4B","created_at":"2026-07-05T02:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:22c1db1a4dc91eb157dc54d1b9d87386358c80e7083b381850997396e6295f11","target":"graph","created_at":"2026-07-05T02:26:26Z","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/2003.13479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Iterative Closest Point (ICP) solves the rigid point cloud registration problem iteratively in two steps: (1) make hard assignments of spatially closest point correspondences, and then (2) find the least-squares rigid transformation. The hard assignments of closest point correspondences based on spatial distances are sensitive to the initial rigid transformation and noisy/outlier points, which often cause ICP to converge to wrong local minima. In this paper, we propose the RPM-Net -- a less sensitive to initialization and more robust deep learning-based approach for rigid point cloud registrat","authors_text":"Gim Hee Lee, Zi Jian Yew","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-30T13:45:27Z","title":"RPM-Net: Robust Point Matching using Learned Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.13479","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:550459f4b8cb1e9c81ef67f384991d7cc1c691151d634721e1a81ff468d17eba","target":"record","created_at":"2026-07-05T02:26:26Z","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":"a3ed467a887d0fdefcfb0c0e9bbc988017476b5bc248747b4c504afaca405bf3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-03-30T13:45:27Z","title_canon_sha256":"dd805f17f28a520bf1b325205bcff0fee8a9fdb506e912c8d6c3ea38f39cf624"},"schema_version":"1.0","source":{"id":"2003.13479","kind":"arxiv","version":1}},"canonical_sha256":"fb2f694781cd5ef0efb3627f981162316379f7f4262e651a154ba9dd6ac25c5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb2f694781cd5ef0efb3627f981162316379f7f4262e651a154ba9dd6ac25c5f","first_computed_at":"2026-07-05T02:26:26.248964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:26:26.248964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CvTbOQEMEL6oVZLbGhGeTD1ROdxA1KXfmNm1CHF4t2KdtPDFOmPOZrWYdSpat7Stc9eDtwzdA1a7WqmSeeXQDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:26:26.249464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.13479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:550459f4b8cb1e9c81ef67f384991d7cc1c691151d634721e1a81ff468d17eba","sha256:22c1db1a4dc91eb157dc54d1b9d87386358c80e7083b381850997396e6295f11"],"state_sha256":"4a98f7240d3c6b6eac8a6d71e94c51b7318fe60b23d87d6f08c3988118d50df3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H96Pz3Rid/Gs2ExngVRKmAxwyRnIlOPv1hR13j287bjaOnxOZByFlemgE22Bdt2OFWPeYz8mBJ6RrcG7HsVABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T11:44:31.313513Z","bundle_sha256":"076373726cd908bc81f63bda37498bab2de3732b01d83a771978ee0dc2a5baee"}}