{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:USQZO4EYUO752O56M7P7IQ4QEA","short_pith_number":"pith:USQZO4EY","canonical_record":{"source":{"id":"1508.01295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T07:16:45Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"5cb969046f78de840a7e598b88af0978a4b28576835106984c09feb1d74873ab","abstract_canon_sha256":"ebb75e5ca8291fdb2c01d9b1bac872bda2b386b355f7daf6136f5c961f62b601"},"schema_version":"1.0"},"canonical_sha256":"a4a1977098a3bfdd3bbe67dff44390201c0de29c86d0fb1db8753d7126ca57e7","source":{"kind":"arxiv","id":"1508.01295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01295","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01295v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01295","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"USQZO4EYUO75","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"USQZO4EYUO752O56","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"USQZO4EY","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:USQZO4EYUO752O56M7P7IQ4QEA","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T07:16:45Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"5cb969046f78de840a7e598b88af0978a4b28576835106984c09feb1d74873ab","abstract_canon_sha256":"ebb75e5ca8291fdb2c01d9b1bac872bda2b386b355f7daf6136f5c961f62b601"},"schema_version":"1.0"},"canonical_sha256":"a4a1977098a3bfdd3bbe67dff44390201c0de29c86d0fb1db8753d7126ca57e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:42.966284Z","signature_b64":"7oYefI2M82wooFVxAlQTqqfum3hhuL6bumLNbeJRUGXeAjKpOL4aaSAwk1hM403udOjW2yThi630VDU9juKWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4a1977098a3bfdd3bbe67dff44390201c0de29c86d0fb1db8753d7126ca57e7","last_reissued_at":"2026-05-18T01:35:42.965844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:42.965844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01295","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-18T01:35:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oe1zqal4Nk7h36z/leqb4EvK/OGqYUF7mP1z0kdbM/QwvdrJS+02qbr6Vp9RHJNKEQtdVm6R5SAf/RUvwQtFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:38:40.396396Z"},"content_sha256":"ca20b7f20945469313202e710a576168f6164701a8d7de9f05413f8e45b529d4","schema_version":"1.0","event_id":"sha256:ca20b7f20945469313202e710a576168f6164701a8d7de9f05413f8e45b529d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:USQZO4EYUO752O56M7P7IQ4QEA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secret key-based Identification and Authentication with a Privacy Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Kittipong Kittichokechai","submitted_at":"2015-08-06T07:16:45Z","abstract_excerpt":"We consider the problem of identification and authentication based on secret key generation from some user-generated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as authenticate them based on the estimated secret key while preserving the privacy of the enrolled data and of the generated keys. We characterize the optimal tradeoff between the identification rate, the compression rate of the users' source data, information leakage rate, and secret key rate. In particular, we provide a coding strategy based on layered random binn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01295","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-18T01:35:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6uKQjfba0bm1ACoS2mExkbeeZZUQTEyUyIjcUsjNEK74FFsI/ya0DRdH8kb6iXTBia7Srvx98PEp1tKLgkmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:38:40.397367Z"},"content_sha256":"b341feedae4094c54636caaa6fd6db8b62cca3b035b4f7869c96cbb780306748","schema_version":"1.0","event_id":"sha256:b341feedae4094c54636caaa6fd6db8b62cca3b035b4f7869c96cbb780306748"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/USQZO4EYUO752O56M7P7IQ4QEA/bundle.json","state_url":"https://pith.science/pith/USQZO4EYUO752O56M7P7IQ4QEA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/USQZO4EYUO752O56M7P7IQ4QEA/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-30T14:38:40Z","links":{"resolver":"https://pith.science/pith/USQZO4EYUO752O56M7P7IQ4QEA","bundle":"https://pith.science/pith/USQZO4EYUO752O56M7P7IQ4QEA/bundle.json","state":"https://pith.science/pith/USQZO4EYUO752O56M7P7IQ4QEA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/USQZO4EYUO752O56M7P7IQ4QEA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:USQZO4EYUO752O56M7P7IQ4QEA","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":"ebb75e5ca8291fdb2c01d9b1bac872bda2b386b355f7daf6136f5c961f62b601","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T07:16:45Z","title_canon_sha256":"5cb969046f78de840a7e598b88af0978a4b28576835106984c09feb1d74873ab"},"schema_version":"1.0","source":{"id":"1508.01295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01295","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01295v1","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01295","created_at":"2026-05-18T01:35:42Z"},{"alias_kind":"pith_short_12","alias_value":"USQZO4EYUO75","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"USQZO4EYUO752O56","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"USQZO4EY","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:b341feedae4094c54636caaa6fd6db8b62cca3b035b4f7869c96cbb780306748","target":"graph","created_at":"2026-05-18T01:35:42Z","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":"We consider the problem of identification and authentication based on secret key generation from some user-generated source data (e.g., a biometric source). The goal is to reliably identify users pre-enrolled in a database as well as authenticate them based on the estimated secret key while preserving the privacy of the enrolled data and of the generated keys. We characterize the optimal tradeoff between the identification rate, the compression rate of the users' source data, information leakage rate, and secret key rate. In particular, we provide a coding strategy based on layered random binn","authors_text":"Giuseppe Caire, Kittipong Kittichokechai","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T07:16:45Z","title":"Secret key-based Identification and Authentication with a Privacy Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01295","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:ca20b7f20945469313202e710a576168f6164701a8d7de9f05413f8e45b529d4","target":"record","created_at":"2026-05-18T01:35:42Z","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":"ebb75e5ca8291fdb2c01d9b1bac872bda2b386b355f7daf6136f5c961f62b601","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-06T07:16:45Z","title_canon_sha256":"5cb969046f78de840a7e598b88af0978a4b28576835106984c09feb1d74873ab"},"schema_version":"1.0","source":{"id":"1508.01295","kind":"arxiv","version":1}},"canonical_sha256":"a4a1977098a3bfdd3bbe67dff44390201c0de29c86d0fb1db8753d7126ca57e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4a1977098a3bfdd3bbe67dff44390201c0de29c86d0fb1db8753d7126ca57e7","first_computed_at":"2026-05-18T01:35:42.965844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:42.965844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7oYefI2M82wooFVxAlQTqqfum3hhuL6bumLNbeJRUGXeAjKpOL4aaSAwk1hM403udOjW2yThi630VDU9juKWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:42.966284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca20b7f20945469313202e710a576168f6164701a8d7de9f05413f8e45b529d4","sha256:b341feedae4094c54636caaa6fd6db8b62cca3b035b4f7869c96cbb780306748"],"state_sha256":"9fa722c715d88b38684644c89502b1b1ad48caf480d9a0d2e6e16e19c25a8d48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b8WkTtr+YpWi/Pbwhkp0HnMlYqOJC9lhaOuZiP6cx+xQek7QaJHnvmGXEZMSJR/R6BFTKIQoc7wLJ4LEprodAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:38:40.401188Z","bundle_sha256":"a4840513ba26ba1234f526cda58c29345b4665bacb8ae0be273dbfa9f76f263e"}}