{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VCYG2OV3SIA4L2RFM5PQWEHOB2","short_pith_number":"pith:VCYG2OV3","canonical_record":{"source":{"id":"1904.13383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-30T17:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"7891581c1a871a525a05fd1ce254a3095451e9d06f8d0a3d8deb08a931bf55e5","abstract_canon_sha256":"b7daf7dfffcde1adc4d82e2fa68efd4dd2be7a3eeb4c3a81f3a7f0221b00c951"},"schema_version":"1.0"},"canonical_sha256":"a8b06d3abb9201c5ea25675f0b10ee0eae65dd740679865b3387332e03e293fb","source":{"kind":"arxiv","id":"1904.13383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13383","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13383v1","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13383","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"VCYG2OV3SIA4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCYG2OV3SIA4L2RF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCYG2OV3","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VCYG2OV3SIA4L2RFM5PQWEHOB2","target":"record","payload":{"canonical_record":{"source":{"id":"1904.13383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-30T17:31:07Z","cross_cats_sorted":[],"title_canon_sha256":"7891581c1a871a525a05fd1ce254a3095451e9d06f8d0a3d8deb08a931bf55e5","abstract_canon_sha256":"b7daf7dfffcde1adc4d82e2fa68efd4dd2be7a3eeb4c3a81f3a7f0221b00c951"},"schema_version":"1.0"},"canonical_sha256":"a8b06d3abb9201c5ea25675f0b10ee0eae65dd740679865b3387332e03e293fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:21.482462Z","signature_b64":"sCU830U+wJN1F6qEOhW58m92tB18DLXqyhNFisl/URs+pM9oDXV3JNs/FgZ4htTvbiDv/tHbQRkvo+y/5WBxAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8b06d3abb9201c5ea25675f0b10ee0eae65dd740679865b3387332e03e293fb","last_reissued_at":"2026-05-17T23:47:21.481842Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:21.481842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.13383","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VLWYwgCqeLPajtAFaoWDjuqnUcA6ZGnX1Boun4ObyNduciCHEd6z2l2b5cLwC51Mhs7Pa58s+R3CIX1emncaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:44.110198Z"},"content_sha256":"b1d5db08bb17ee68542a96483540c26fa7500640dab736b2afccb16e68e762ee","schema_version":"1.0","event_id":"sha256:b1d5db08bb17ee68542a96483540c26fa7500640dab736b2afccb16e68e762ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VCYG2OV3SIA4L2RFM5PQWEHOB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparative evaluation of 2D feature correspondence selection algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chen Zhao, Jiaqi Yang, Yang Xiao, Zhiguo Cao","submitted_at":"2019-04-30T17:31:07Z","abstract_excerpt":"Correspondence selection aiming at seeking correct feature correspondences from raw feature matches is pivotal for a number of feature-matching-based tasks. Various 2D (image) correspondence selection algorithms have been presented with decades of progress. Unfortunately, the lack of an in-depth evaluation makes it difficult for developers to choose a proper algorithm given a specific application. This paper fills this gap by evaluating eight 2D correspondence selection algorithms ranging from classical methods to the most recent ones on four standard datasets. The diversity of experimental da"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13383","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:47:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5qmPfmkwUKAuzb4bni6EXlP+07Rz83ABwlVdEEEf/tQeZQI8HYl+jTE0PwnTwjXXJ6MM3JF9YW7sE1HS1HXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:49:44.111005Z"},"content_sha256":"04eb34c806560b4f63b4a69c404737c859a86064ca487a1a7cc47849d1b69938","schema_version":"1.0","event_id":"sha256:04eb34c806560b4f63b4a69c404737c859a86064ca487a1a7cc47849d1b69938"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/bundle.json","state_url":"https://pith.science/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/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-05-31T02:49:44Z","links":{"resolver":"https://pith.science/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2","bundle":"https://pith.science/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/bundle.json","state":"https://pith.science/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCYG2OV3SIA4L2RFM5PQWEHOB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VCYG2OV3SIA4L2RFM5PQWEHOB2","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":"b7daf7dfffcde1adc4d82e2fa68efd4dd2be7a3eeb4c3a81f3a7f0221b00c951","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-30T17:31:07Z","title_canon_sha256":"7891581c1a871a525a05fd1ce254a3095451e9d06f8d0a3d8deb08a931bf55e5"},"schema_version":"1.0","source":{"id":"1904.13383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.13383","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"arxiv_version","alias_value":"1904.13383v1","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.13383","created_at":"2026-05-17T23:47:21Z"},{"alias_kind":"pith_short_12","alias_value":"VCYG2OV3SIA4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VCYG2OV3SIA4L2RF","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VCYG2OV3","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:04eb34c806560b4f63b4a69c404737c859a86064ca487a1a7cc47849d1b69938","target":"graph","created_at":"2026-05-17T23:47:21Z","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":"Correspondence selection aiming at seeking correct feature correspondences from raw feature matches is pivotal for a number of feature-matching-based tasks. Various 2D (image) correspondence selection algorithms have been presented with decades of progress. Unfortunately, the lack of an in-depth evaluation makes it difficult for developers to choose a proper algorithm given a specific application. This paper fills this gap by evaluating eight 2D correspondence selection algorithms ranging from classical methods to the most recent ones on four standard datasets. The diversity of experimental da","authors_text":"Chen Zhao, Jiaqi Yang, Yang Xiao, Zhiguo Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-30T17:31:07Z","title":"Comparative evaluation of 2D feature correspondence selection algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.13383","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:b1d5db08bb17ee68542a96483540c26fa7500640dab736b2afccb16e68e762ee","target":"record","created_at":"2026-05-17T23:47:21Z","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":"b7daf7dfffcde1adc4d82e2fa68efd4dd2be7a3eeb4c3a81f3a7f0221b00c951","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-30T17:31:07Z","title_canon_sha256":"7891581c1a871a525a05fd1ce254a3095451e9d06f8d0a3d8deb08a931bf55e5"},"schema_version":"1.0","source":{"id":"1904.13383","kind":"arxiv","version":1}},"canonical_sha256":"a8b06d3abb9201c5ea25675f0b10ee0eae65dd740679865b3387332e03e293fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8b06d3abb9201c5ea25675f0b10ee0eae65dd740679865b3387332e03e293fb","first_computed_at":"2026-05-17T23:47:21.481842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:21.481842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sCU830U+wJN1F6qEOhW58m92tB18DLXqyhNFisl/URs+pM9oDXV3JNs/FgZ4htTvbiDv/tHbQRkvo+y/5WBxAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:21.482462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.13383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1d5db08bb17ee68542a96483540c26fa7500640dab736b2afccb16e68e762ee","sha256:04eb34c806560b4f63b4a69c404737c859a86064ca487a1a7cc47849d1b69938"],"state_sha256":"a7509900a0c8401535aaf7d6c1561fb13b4682df4621e4defd3ebbb343ee865a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Um/UjEBhsQCT6ciL2gM9GiNIWe82OeM6gfWk54HNZlyBQ5XQdkSfQAzQ7HlDFFmbNjYpO56Gqlqhc4Xwnns1Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:49:44.114777Z","bundle_sha256":"91a58f6339a54e6132935c0056c34a2e0a1396dbcd9f7c0964d0cf686c2d93e4"}}