{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3U6OP3NLCTZXAOT3CT33J4TZ4X","short_pith_number":"pith:3U6OP3NL","canonical_record":{"source":{"id":"1411.0791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-04T05:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"71bd7498c12e8915ea62e1d6ad8229b643b25987ed5da83d848d42c8b0d9d711","abstract_canon_sha256":"ec5fc6d63840c47f3a85b9089fb5f1d97b9f357246fd85fc591cc49b990ade87"},"schema_version":"1.0"},"canonical_sha256":"dd3ce7edab14f3703a7b14f7b4f279e5cc36a4354bf68e69a6909c1572b3a97b","source":{"kind":"arxiv","id":"1411.0791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0791","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0791v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0791","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"3U6OP3NLCTZX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3U6OP3NLCTZXAOT3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3U6OP3NL","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3U6OP3NLCTZXAOT3CT33J4TZ4X","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-04T05:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"71bd7498c12e8915ea62e1d6ad8229b643b25987ed5da83d848d42c8b0d9d711","abstract_canon_sha256":"ec5fc6d63840c47f3a85b9089fb5f1d97b9f357246fd85fc591cc49b990ade87"},"schema_version":"1.0"},"canonical_sha256":"dd3ce7edab14f3703a7b14f7b4f279e5cc36a4354bf68e69a6909c1572b3a97b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.256235Z","signature_b64":"lr00bfUT/ajF++GeczQGeqIN0aGUsWAmxchDnX5nkNO/UGs1G1oqxYrV0mXzHuyL2+PEdG/QPFVrwKMCGVcMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd3ce7edab14f3703a7b14f7b4f279e5cc36a4354bf68e69a6909c1572b3a97b","last_reissued_at":"2026-05-18T02:38:38.255671Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.255671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0791","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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tb0/0gvB8rVpovCCkGCzTcUjs5Wv3ikV/YoXvQ9nenrw2WmaF4Kbc1Lqo8KiedNJVfb10bbgXfs3Nxo+1t+7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:16:23.397418Z"},"content_sha256":"c83c0c34dc634fbf8e1e94d35cfc68f37f700e5de717c4fc2352c691719dc81e","schema_version":"1.0","event_id":"sha256:c83c0c34dc634fbf8e1e94d35cfc68f37f700e5de717c4fc2352c691719dc81e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3U6OP3NLCTZXAOT3CT33J4TZ4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Point Sets Matching Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Congying Han, Tiande Guo, Xiao Liu","submitted_at":"2014-11-04T05:53:45Z","abstract_excerpt":"Point sets matching method is very important in computer vision, feature extraction, fingerprint matching, motion estimation and so on. This paper proposes a robust point sets matching method. We present an iterative algorithm that is robust to noise case. Firstly, we calculate all transformations between two points. Then similarity matrix are computed to measure the possibility that two transformation are both true. We iteratively update the matching score matrix by using the similarity matrix. By using matching algorithm on graph, we obtain the matching result. Experimental results obtained "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0791","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-18T02:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CM21TfwNffaEbID3axSO+9zaLWPUidLglNW+GipbfBF53XLXHaREAWiu2E9ly5oJqnsFiiLdU+m9H7EXOMk9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:16:23.398049Z"},"content_sha256":"98014a07ee28be11929ab8ee9619c65f22f892383719999c6abbec6c6851f4ab","schema_version":"1.0","event_id":"sha256:98014a07ee28be11929ab8ee9619c65f22f892383719999c6abbec6c6851f4ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/bundle.json","state_url":"https://pith.science/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/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-30T13:16:23Z","links":{"resolver":"https://pith.science/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X","bundle":"https://pith.science/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/bundle.json","state":"https://pith.science/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3U6OP3NLCTZXAOT3CT33J4TZ4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3U6OP3NLCTZXAOT3CT33J4TZ4X","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":"ec5fc6d63840c47f3a85b9089fb5f1d97b9f357246fd85fc591cc49b990ade87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-04T05:53:45Z","title_canon_sha256":"71bd7498c12e8915ea62e1d6ad8229b643b25987ed5da83d848d42c8b0d9d711"},"schema_version":"1.0","source":{"id":"1411.0791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0791","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0791v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0791","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"3U6OP3NLCTZX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3U6OP3NLCTZXAOT3","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3U6OP3NL","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:98014a07ee28be11929ab8ee9619c65f22f892383719999c6abbec6c6851f4ab","target":"graph","created_at":"2026-05-18T02:38:38Z","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":"Point sets matching method is very important in computer vision, feature extraction, fingerprint matching, motion estimation and so on. This paper proposes a robust point sets matching method. We present an iterative algorithm that is robust to noise case. Firstly, we calculate all transformations between two points. Then similarity matrix are computed to measure the possibility that two transformation are both true. We iteratively update the matching score matrix by using the similarity matrix. By using matching algorithm on graph, we obtain the matching result. Experimental results obtained ","authors_text":"Congying Han, Tiande Guo, Xiao Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-04T05:53:45Z","title":"A Robust Point Sets Matching Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0791","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:c83c0c34dc634fbf8e1e94d35cfc68f37f700e5de717c4fc2352c691719dc81e","target":"record","created_at":"2026-05-18T02:38:38Z","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":"ec5fc6d63840c47f3a85b9089fb5f1d97b9f357246fd85fc591cc49b990ade87","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-11-04T05:53:45Z","title_canon_sha256":"71bd7498c12e8915ea62e1d6ad8229b643b25987ed5da83d848d42c8b0d9d711"},"schema_version":"1.0","source":{"id":"1411.0791","kind":"arxiv","version":1}},"canonical_sha256":"dd3ce7edab14f3703a7b14f7b4f279e5cc36a4354bf68e69a6909c1572b3a97b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd3ce7edab14f3703a7b14f7b4f279e5cc36a4354bf68e69a6909c1572b3a97b","first_computed_at":"2026-05-18T02:38:38.255671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.255671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lr00bfUT/ajF++GeczQGeqIN0aGUsWAmxchDnX5nkNO/UGs1G1oqxYrV0mXzHuyL2+PEdG/QPFVrwKMCGVcMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.256235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c83c0c34dc634fbf8e1e94d35cfc68f37f700e5de717c4fc2352c691719dc81e","sha256:98014a07ee28be11929ab8ee9619c65f22f892383719999c6abbec6c6851f4ab"],"state_sha256":"ed3555ab2c55f0e11243cdd41736fe82a182049e01ec179da030d5a2951cd5a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6TQ06H1Yw01EPASVTaT6MfjnBm64NL29VI8OPV1TcJ6Pjkgi5iDRI7g1Zhl2qO1d6OfsgOLeS1/ODBTEppyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:16:23.401360Z","bundle_sha256":"ae7e94a8bd4715187383a332d634bf81b71bb2470c803d0c48675f4752b5b51d"}}