{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GZWXVQIFAIJLWTYFNRVLVFKQ3E","short_pith_number":"pith:GZWXVQIF","canonical_record":{"source":{"id":"1702.01870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-07T03:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"8839b5aa3866ce9b9af2b74ac4c9d6e7f9104c7c3bca826df508eea5b08459a8","abstract_canon_sha256":"95fb3be8e7a100a98644ebf73c735ad421b085139412cc328ab3cc64e0d6a263"},"schema_version":"1.0"},"canonical_sha256":"366d7ac1050212bb4f056c6aba9550d9311dd778124e799d61ed6283332be358","source":{"kind":"arxiv","id":"1702.01870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01870","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01870v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01870","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"GZWXVQIFAIJL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GZWXVQIFAIJLWTYF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GZWXVQIF","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GZWXVQIFAIJLWTYFNRVLVFKQ3E","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-07T03:43:31Z","cross_cats_sorted":[],"title_canon_sha256":"8839b5aa3866ce9b9af2b74ac4c9d6e7f9104c7c3bca826df508eea5b08459a8","abstract_canon_sha256":"95fb3be8e7a100a98644ebf73c735ad421b085139412cc328ab3cc64e0d6a263"},"schema_version":"1.0"},"canonical_sha256":"366d7ac1050212bb4f056c6aba9550d9311dd778124e799d61ed6283332be358","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:11.061488Z","signature_b64":"xMbps/hUVOTE2whqLz46e10q94gfm0Y+E3pq/RAiDmyT29IHg3SApWTJOgJsyvCMIH8MKViVCU0jzXnEWq6wBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"366d7ac1050212bb4f056c6aba9550d9311dd778124e799d61ed6283332be358","last_reissued_at":"2026-05-18T00:51:11.060945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:11.060945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01870","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-18T00:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1SUEyE86FxjQCr1/fQqhG1xZDvGCewjzd5uMYkoQLdB2iAuYZycmx9NdUB4P9FBdHDrNz3cSbKzt7A8Am8zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:55:37.511139Z"},"content_sha256":"608d03141793e9163718af725525ac19db3122bad49b8a609806f6182641e770","schema_version":"1.0","event_id":"sha256:608d03141793e9163718af725525ac19db3122bad49b8a609806f6182641e770"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GZWXVQIFAIJLWTYFNRVLVFKQ3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Point-set Registration Algorithm for Fingerprint Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Alexander Ushveridze, A. Pasha Hosseinbor, Renat Zhdanov","submitted_at":"2017-02-07T03:43:31Z","abstract_excerpt":"A novel minutia-based fingerprint matching algorithm is proposed that employs iterative global alignment on two minutia sets. The matcher considers all possible minutia pairings and iteratively aligns the two sets until the number of minutia pairs does not exceed the maximum number of allowable one-to-one pairings. The optimal alignment parameters are derived analytically via linear least squares. The first alignment establishes a region of overlap between the two minutia sets, which is then (iteratively) refined by each successive alignment. After each alignment, minutia pairs that exhibit we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01870","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-18T00:51:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ue/dD+Lx1F/joZGqTHUg/L4HoDLI7fHRZP+KceBJsD2SqgD5QOuGJt/R/4WHaqifd/50w3UMvNhAdCl2tyCeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:55:37.511503Z"},"content_sha256":"f94556f4c477b53b5bb32e555457af93d5cb2650ea753c57e1fce57c0319281f","schema_version":"1.0","event_id":"sha256:f94556f4c477b53b5bb32e555457af93d5cb2650ea753c57e1fce57c0319281f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/bundle.json","state_url":"https://pith.science/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/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-08T21:55:37Z","links":{"resolver":"https://pith.science/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E","bundle":"https://pith.science/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/bundle.json","state":"https://pith.science/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GZWXVQIFAIJLWTYFNRVLVFKQ3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GZWXVQIFAIJLWTYFNRVLVFKQ3E","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":"95fb3be8e7a100a98644ebf73c735ad421b085139412cc328ab3cc64e0d6a263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-07T03:43:31Z","title_canon_sha256":"8839b5aa3866ce9b9af2b74ac4c9d6e7f9104c7c3bca826df508eea5b08459a8"},"schema_version":"1.0","source":{"id":"1702.01870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01870","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01870v1","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01870","created_at":"2026-05-18T00:51:11Z"},{"alias_kind":"pith_short_12","alias_value":"GZWXVQIFAIJL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GZWXVQIFAIJLWTYF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GZWXVQIF","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:f94556f4c477b53b5bb32e555457af93d5cb2650ea753c57e1fce57c0319281f","target":"graph","created_at":"2026-05-18T00:51:11Z","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":"A novel minutia-based fingerprint matching algorithm is proposed that employs iterative global alignment on two minutia sets. The matcher considers all possible minutia pairings and iteratively aligns the two sets until the number of minutia pairs does not exceed the maximum number of allowable one-to-one pairings. The optimal alignment parameters are derived analytically via linear least squares. The first alignment establishes a region of overlap between the two minutia sets, which is then (iteratively) refined by each successive alignment. After each alignment, minutia pairs that exhibit we","authors_text":"Alexander Ushveridze, A. Pasha Hosseinbor, Renat Zhdanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-07T03:43:31Z","title":"A New Point-set Registration Algorithm for Fingerprint Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01870","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:608d03141793e9163718af725525ac19db3122bad49b8a609806f6182641e770","target":"record","created_at":"2026-05-18T00:51:11Z","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":"95fb3be8e7a100a98644ebf73c735ad421b085139412cc328ab3cc64e0d6a263","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-07T03:43:31Z","title_canon_sha256":"8839b5aa3866ce9b9af2b74ac4c9d6e7f9104c7c3bca826df508eea5b08459a8"},"schema_version":"1.0","source":{"id":"1702.01870","kind":"arxiv","version":1}},"canonical_sha256":"366d7ac1050212bb4f056c6aba9550d9311dd778124e799d61ed6283332be358","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"366d7ac1050212bb4f056c6aba9550d9311dd778124e799d61ed6283332be358","first_computed_at":"2026-05-18T00:51:11.060945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:11.060945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xMbps/hUVOTE2whqLz46e10q94gfm0Y+E3pq/RAiDmyT29IHg3SApWTJOgJsyvCMIH8MKViVCU0jzXnEWq6wBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:11.061488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:608d03141793e9163718af725525ac19db3122bad49b8a609806f6182641e770","sha256:f94556f4c477b53b5bb32e555457af93d5cb2650ea753c57e1fce57c0319281f"],"state_sha256":"3479672a30dbf3a2d85826f54576ee9508a9859d25d52fba3438f5cc339301d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ffJH5WpYa10IGyPLt3c1oohW/unIF0hR1z4qKsidYgfk6W6xCR2ICmWdXfnfTd6y6gtNUsuQv+wbYf2QReuZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:55:37.513284Z","bundle_sha256":"a0ba226cac5a27453eced34c5f3bc524cda20d320af6f1a8ffd09344a575422f"}}