{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X6THBBX5TBCRZNMOFMQ7BXRNZY","short_pith_number":"pith:X6THBBX5","canonical_record":{"source":{"id":"1907.02890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-05T15:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"1529c13e2e3d438b8e094fb6381c4c567bdede3d8a890c7d5cf2c362758c301e","abstract_canon_sha256":"b82b66b3f086482cd477bd7339a7342b75616f919352efe9c8bda4fb1aa7dc1b"},"schema_version":"1.0"},"canonical_sha256":"bfa67086fd98451cb58e2b21f0de2dce3be3c52fa80861018781ad3f3ed72393","source":{"kind":"arxiv","id":"1907.02890","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02890","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02890v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02890","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"X6THBBX5TBCR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X6THBBX5TBCRZNMO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X6THBBX5","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X6THBBX5TBCRZNMOFMQ7BXRNZY","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02890","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-05T15:22:24Z","cross_cats_sorted":[],"title_canon_sha256":"1529c13e2e3d438b8e094fb6381c4c567bdede3d8a890c7d5cf2c362758c301e","abstract_canon_sha256":"b82b66b3f086482cd477bd7339a7342b75616f919352efe9c8bda4fb1aa7dc1b"},"schema_version":"1.0"},"canonical_sha256":"bfa67086fd98451cb58e2b21f0de2dce3be3c52fa80861018781ad3f3ed72393","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.718732Z","signature_b64":"HUU2iL9INwzcqT0+HrtrrnJeRWpju5zqNn3OEDQ5/Ja5Pi2741e85jN7rGGvJggAyjPrFnXxds4SdECjUr+iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfa67086fd98451cb58e2b21f0de2dce3be3c52fa80861018781ad3f3ed72393","last_reissued_at":"2026-05-17T23:41:22.718050Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.718050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02890","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-05-17T23:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cuQQj2mBOfIKZJ0In79PTekKIQ5WHXLexTRtX1e0NOBQGM3aszBYw8IORi5fTqC/+0ykerG4KEUiuotVDWFiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:40:56.703145Z"},"content_sha256":"b843f10759639e50f8390b27e3b59a00d7c812081c10307723517e4b7dd3519b","schema_version":"1.0","event_id":"sha256:b843f10759639e50f8390b27e3b59a00d7c812081c10307723517e4b7dd3519b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X6THBBX5TBCRZNMOFMQ7BXRNZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Performance Evaluation of Correspondence Grouping Methods for 3D Rigid Data Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jiaqi Yang, Ke Xian, Peng Wang, Yanning Zhang","submitted_at":"2019-07-05T15:22:24Z","abstract_excerpt":"Seeking consistent point-to-point correspondences between 3D rigid data (point clouds, meshes, or depth maps) is a fundamental problem in 3D computer vision. While a number of correspondence selection methods have been proposed in recent years, their advantages and shortcomings remain unclear regarding different applications and perturbations. To fill this gap, this paper gives a comprehensive evaluation of nine state-of-the-art 3D correspondence grouping methods. A good correspondence grouping algorithm is expected to retrieve as many as inliers from initial feature matches, giving a rise in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02890","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":""},"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-05-17T23:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvbcZMeVd7Omq3xoMK4eRPSXSoaT37JVtwNTRCd4rzt7qifzcih1dUD2FWw3hAPxLY+sjqvs0n2L2RqGihp+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:40:56.703624Z"},"content_sha256":"fe86eb5df45be6d97c3305160a390edd204cf88b281f39f96fc1928c8aa2777b","schema_version":"1.0","event_id":"sha256:fe86eb5df45be6d97c3305160a390edd204cf88b281f39f96fc1928c8aa2777b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/bundle.json","state_url":"https://pith.science/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/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-06-24T23:40:56Z","links":{"resolver":"https://pith.science/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY","bundle":"https://pith.science/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/bundle.json","state":"https://pith.science/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6THBBX5TBCRZNMOFMQ7BXRNZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X6THBBX5TBCRZNMOFMQ7BXRNZY","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":"b82b66b3f086482cd477bd7339a7342b75616f919352efe9c8bda4fb1aa7dc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-05T15:22:24Z","title_canon_sha256":"1529c13e2e3d438b8e094fb6381c4c567bdede3d8a890c7d5cf2c362758c301e"},"schema_version":"1.0","source":{"id":"1907.02890","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02890","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02890v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02890","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"X6THBBX5TBCR","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X6THBBX5TBCRZNMO","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X6THBBX5","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:fe86eb5df45be6d97c3305160a390edd204cf88b281f39f96fc1928c8aa2777b","target":"graph","created_at":"2026-05-17T23:41:22Z","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"},"paper":{"abstract_excerpt":"Seeking consistent point-to-point correspondences between 3D rigid data (point clouds, meshes, or depth maps) is a fundamental problem in 3D computer vision. While a number of correspondence selection methods have been proposed in recent years, their advantages and shortcomings remain unclear regarding different applications and perturbations. To fill this gap, this paper gives a comprehensive evaluation of nine state-of-the-art 3D correspondence grouping methods. A good correspondence grouping algorithm is expected to retrieve as many as inliers from initial feature matches, giving a rise in ","authors_text":"Jiaqi Yang, Ke Xian, Peng Wang, Yanning Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-05T15:22:24Z","title":"A Performance Evaluation of Correspondence Grouping Methods for 3D Rigid Data Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02890","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:b843f10759639e50f8390b27e3b59a00d7c812081c10307723517e4b7dd3519b","target":"record","created_at":"2026-05-17T23:41:22Z","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":"b82b66b3f086482cd477bd7339a7342b75616f919352efe9c8bda4fb1aa7dc1b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-07-05T15:22:24Z","title_canon_sha256":"1529c13e2e3d438b8e094fb6381c4c567bdede3d8a890c7d5cf2c362758c301e"},"schema_version":"1.0","source":{"id":"1907.02890","kind":"arxiv","version":1}},"canonical_sha256":"bfa67086fd98451cb58e2b21f0de2dce3be3c52fa80861018781ad3f3ed72393","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfa67086fd98451cb58e2b21f0de2dce3be3c52fa80861018781ad3f3ed72393","first_computed_at":"2026-05-17T23:41:22.718050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:22.718050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HUU2iL9INwzcqT0+HrtrrnJeRWpju5zqNn3OEDQ5/Ja5Pi2741e85jN7rGGvJggAyjPrFnXxds4SdECjUr+iCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:22.718732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02890","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b843f10759639e50f8390b27e3b59a00d7c812081c10307723517e4b7dd3519b","sha256:fe86eb5df45be6d97c3305160a390edd204cf88b281f39f96fc1928c8aa2777b"],"state_sha256":"db0c2fd4e1bf8ede595f9d2540a4a71ee73502ca2db13549ca3e5c66b6cd952a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZAPRBS0wLW3rgOTK7bbbyPaQ+OceuruVcQjmkulUnUCJDWn9kTFPx/sANdfsKZotjW+yh8TdruaLhB/Ob4mAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:40:56.706170Z","bundle_sha256":"3a28e77335b4dfcb77d8455099437435341604f1f62055f6cce7d645f3992b2e"}}