{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YWGAPMX7JJAQ2XZJXKZRQ74ZAK","short_pith_number":"pith:YWGAPMX7","canonical_record":{"source":{"id":"1803.08394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T15:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"0b49de54371078e236db68687e0c0d2cf07dbf89033333502149bb9a7f6a889c","abstract_canon_sha256":"ae6178f0eced82feb33eeb19767723b852fd327a1d5808412debe09caab9faa9"},"schema_version":"1.0"},"canonical_sha256":"c58c07b2ff4a410d5f29bab3187f9902845c4fcd9aa576fbac11dce17b787d03","source":{"kind":"arxiv","id":"1803.08394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08394","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08394v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08394","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"YWGAPMX7JJAQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YWGAPMX7JJAQ2XZJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YWGAPMX7","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YWGAPMX7JJAQ2XZJXKZRQ74ZAK","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T15:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"0b49de54371078e236db68687e0c0d2cf07dbf89033333502149bb9a7f6a889c","abstract_canon_sha256":"ae6178f0eced82feb33eeb19767723b852fd327a1d5808412debe09caab9faa9"},"schema_version":"1.0"},"canonical_sha256":"c58c07b2ff4a410d5f29bab3187f9902845c4fcd9aa576fbac11dce17b787d03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:04.956054Z","signature_b64":"Q0aLgWh7aDtArBB0RODDpDZl1N7yT4Y2akw1/gXmaKyRVZUO1Rgadv/46AQ+NVlHiT8H7NxQuyX2hFeGywEqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c58c07b2ff4a410d5f29bab3187f9902845c4fcd9aa576fbac11dce17b787d03","last_reissued_at":"2026-05-18T00:18:04.955534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:04.955534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08394","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:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJyeC13SjK+/dbnmpj4tmEu2x5y+QgsyrSSsmUW6cuVglu4XfVRW9rhl5+DgCZ2kVJDH1A+oQ9JTx6O0+DOrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:19:10.567217Z"},"content_sha256":"3e04741b79a99f7b0c5b8859105828e3d23dad736ccbfddbe8f9a80734349821","schema_version":"1.0","event_id":"sha256:3e04741b79a99f7b0c5b8859105828e3d23dad736ccbfddbe8f9a80734349821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YWGAPMX7JJAQ2XZJXKZRQ74ZAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Found a good match: should I keep searching? - Accuracy and Performance in Iris Matching Using 1-to-First Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Andrey Kuehlkamp, Kevin Bowyer","submitted_at":"2018-03-22T15:07:53Z","abstract_excerpt":"Iris recognition is used in many applications around the world, with enrollment sizes as large as over one billion persons in India's Aadhaar program. Large enrollment sizes can require special optimizations in order to achieve fast database searches. One such optimization that has been used in some operational scenarios is 1:First search. In this approach, instead of scanning the entire database, the search is terminated when the first sufficiently good match is found. This saves time, but ignores potentially better matches that may exist in the unexamined portion of the enrollments. At least"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08394","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:18:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/v3qdbfd4tTF9tBSHiEG3SmWnpcmFLm4QMDZ+pS415vzkDEP6KweqR9Va1/hkmlVJKk0OhrsjM0PI+/I3JRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:19:10.567564Z"},"content_sha256":"6f4cfcd8b4256970a845b4f2f79d049f084b251c47b1e96363746ce0b24ba5d2","schema_version":"1.0","event_id":"sha256:6f4cfcd8b4256970a845b4f2f79d049f084b251c47b1e96363746ce0b24ba5d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/bundle.json","state_url":"https://pith.science/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/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-09T13:19:10Z","links":{"resolver":"https://pith.science/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK","bundle":"https://pith.science/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/bundle.json","state":"https://pith.science/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWGAPMX7JJAQ2XZJXKZRQ74ZAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YWGAPMX7JJAQ2XZJXKZRQ74ZAK","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":"ae6178f0eced82feb33eeb19767723b852fd327a1d5808412debe09caab9faa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T15:07:53Z","title_canon_sha256":"0b49de54371078e236db68687e0c0d2cf07dbf89033333502149bb9a7f6a889c"},"schema_version":"1.0","source":{"id":"1803.08394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08394","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08394v1","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08394","created_at":"2026-05-18T00:18:04Z"},{"alias_kind":"pith_short_12","alias_value":"YWGAPMX7JJAQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YWGAPMX7JJAQ2XZJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YWGAPMX7","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6f4cfcd8b4256970a845b4f2f79d049f084b251c47b1e96363746ce0b24ba5d2","target":"graph","created_at":"2026-05-18T00:18:04Z","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":"Iris recognition is used in many applications around the world, with enrollment sizes as large as over one billion persons in India's Aadhaar program. Large enrollment sizes can require special optimizations in order to achieve fast database searches. One such optimization that has been used in some operational scenarios is 1:First search. In this approach, instead of scanning the entire database, the search is terminated when the first sufficiently good match is found. This saves time, but ignores potentially better matches that may exist in the unexamined portion of the enrollments. At least","authors_text":"Andrey Kuehlkamp, Kevin Bowyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T15:07:53Z","title":"Found a good match: should I keep searching? - Accuracy and Performance in Iris Matching Using 1-to-First Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08394","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:3e04741b79a99f7b0c5b8859105828e3d23dad736ccbfddbe8f9a80734349821","target":"record","created_at":"2026-05-18T00:18:04Z","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":"ae6178f0eced82feb33eeb19767723b852fd327a1d5808412debe09caab9faa9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-22T15:07:53Z","title_canon_sha256":"0b49de54371078e236db68687e0c0d2cf07dbf89033333502149bb9a7f6a889c"},"schema_version":"1.0","source":{"id":"1803.08394","kind":"arxiv","version":1}},"canonical_sha256":"c58c07b2ff4a410d5f29bab3187f9902845c4fcd9aa576fbac11dce17b787d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c58c07b2ff4a410d5f29bab3187f9902845c4fcd9aa576fbac11dce17b787d03","first_computed_at":"2026-05-18T00:18:04.955534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:04.955534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q0aLgWh7aDtArBB0RODDpDZl1N7yT4Y2akw1/gXmaKyRVZUO1Rgadv/46AQ+NVlHiT8H7NxQuyX2hFeGywEqDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:04.956054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e04741b79a99f7b0c5b8859105828e3d23dad736ccbfddbe8f9a80734349821","sha256:6f4cfcd8b4256970a845b4f2f79d049f084b251c47b1e96363746ce0b24ba5d2"],"state_sha256":"05bb11e59c4ad06c543e338c48bf909fa6ca946fd55c70985a7ff473312289cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtAA36FbAgJ+lZeUBUKMJZzvtnpDxs37BZaHzLBeIeShimISIJqkryGvSzLkiUoeqR7jhZFbGhSq+w3iL5zPAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:19:10.569498Z","bundle_sha256":"ac32cd3023c87d98f978d1f9159eeb24d817a9188012d89467ed192406d449d9"}}