{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:35NK4RKH4C4CRFMPQNZFH4DC2U","short_pith_number":"pith:35NK4RKH","schema_version":"1.0","canonical_sha256":"df5aae4547e0b828958f837253f062d5364c9a00736d31d04548c07910849523","source":{"kind":"arxiv","id":"1702.01167","version":1},"attestation_state":"computed","paper":{"title":"An Analysis of 1-to-First Matching in Iris Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrey Kuehlkamp, Kevin W. Bowyer","submitted_at":"2017-02-03T21:24:10Z","abstract_excerpt":"Iris recognition systems are a mature technology that is widely used throughout the world. In identification (as opposed to verification) mode, an iris to be recognized is typically matched against all N enrolled irises. This is the classic \"1-to-N search\". In order to improve the speed of large-scale identification, a modified \"1-to-First\" search has been used in some operational systems. A 1-to-First search terminates with the first below-threshold match that is found, whereas a 1-to-N search always finds the best match across all enrollments. We know of no previous studies that evaluate how"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1702.01167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-02-03T21:24:10Z","cross_cats_sorted":[],"title_canon_sha256":"613999e629ed4eb3f6048f9bebe30900caaab86729afe101967fa3ac510481f7","abstract_canon_sha256":"9cf36abe6082042df280be8433282936e3582a6863bc26fdee6cc8ddee265c44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:24.359515Z","signature_b64":"y59RZ1y35lxUY9glSwUYfN3/le3qcqpPPssfGwhf2QaXgy80inN2whgz4F0v74M2MlFfbeswXJ9wGqzMxQr6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5aae4547e0b828958f837253f062d5364c9a00736d31d04548c07910849523","last_reissued_at":"2026-05-18T00:51:24.358826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:24.358826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Analysis of 1-to-First Matching in Iris Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrey Kuehlkamp, Kevin W. Bowyer","submitted_at":"2017-02-03T21:24:10Z","abstract_excerpt":"Iris recognition systems are a mature technology that is widely used throughout the world. In identification (as opposed to verification) mode, an iris to be recognized is typically matched against all N enrolled irises. This is the classic \"1-to-N search\". In order to improve the speed of large-scale identification, a modified \"1-to-First\" search has been used in some operational systems. A 1-to-First search terminates with the first below-threshold match that is found, whereas a 1-to-N search always finds the best match across all enrollments. We know of no previous studies that evaluate how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01167","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.01167","created_at":"2026-05-18T00:51:24.358926+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01167v1","created_at":"2026-05-18T00:51:24.358926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01167","created_at":"2026-05-18T00:51:24.358926+00:00"},{"alias_kind":"pith_short_12","alias_value":"35NK4RKH4C4C","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"35NK4RKH4C4CRFMP","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"35NK4RKH","created_at":"2026-05-18T12:30:58.224056+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U","json":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U.json","graph_json":"https://pith.science/api/pith-number/35NK4RKH4C4CRFMPQNZFH4DC2U/graph.json","events_json":"https://pith.science/api/pith-number/35NK4RKH4C4CRFMPQNZFH4DC2U/events.json","paper":"https://pith.science/paper/35NK4RKH"},"agent_actions":{"view_html":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U","download_json":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U.json","view_paper":"https://pith.science/paper/35NK4RKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01167&json=true","fetch_graph":"https://pith.science/api/pith-number/35NK4RKH4C4CRFMPQNZFH4DC2U/graph.json","fetch_events":"https://pith.science/api/pith-number/35NK4RKH4C4CRFMPQNZFH4DC2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U/action/storage_attestation","attest_author":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U/action/author_attestation","sign_citation":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U/action/citation_signature","submit_replication":"https://pith.science/pith/35NK4RKH4C4CRFMPQNZFH4DC2U/action/replication_record"}},"created_at":"2026-05-18T00:51:24.358926+00:00","updated_at":"2026-05-18T00:51:24.358926+00:00"}