{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MKEWP2DHFJDPZVLJUE7IBPSOP7","short_pith_number":"pith:MKEWP2DH","canonical_record":{"source":{"id":"1702.06649","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T02:18:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e86e6b0a2b04253ded18a13a2853219fcaf65c706532f12c59623a87f677a2f","abstract_canon_sha256":"d50dfea91b6575ac9218be12485fc79237f36adb11ff9b6da3fe8801b5b199ba"},"schema_version":"1.0"},"canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","source":{"kind":"arxiv","id":"1702.06649","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06649","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06649v2","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06649","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"MKEWP2DHFJDP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MKEWP2DHFJDPZVLJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MKEWP2DH","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MKEWP2DHFJDPZVLJUE7IBPSOP7","target":"record","payload":{"canonical_record":{"source":{"id":"1702.06649","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T02:18:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e86e6b0a2b04253ded18a13a2853219fcaf65c706532f12c59623a87f677a2f","abstract_canon_sha256":"d50dfea91b6575ac9218be12485fc79237f36adb11ff9b6da3fe8801b5b199ba"},"schema_version":"1.0"},"canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:21.732740Z","signature_b64":"+JSTL4bjGnDzFZBn/+s62v5IVpdEFKKoCDVLhNI4R7zujKj/9scXlLI4Mk2eZhPqYo5Sjs1n/E6ObxMjj1/dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","last_reissued_at":"2026-05-18T00:27:21.732085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:21.732085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.06649","source_version":2,"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:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bn2i0OAxejNBNVdzKd7EVVr7cCcStISKP6qyvmh32NozQzirwKM+1aRv8mmlNGgvQD9tAc7oh0qj6bJ3WClVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:51:18.882974Z"},"content_sha256":"3bf03b88fb050b4fe100842150715a59d4e776476e1718dbc781337e661a2d50","schema_version":"1.0","event_id":"sha256:3bf03b88fb050b4fe100842150715a59d4e776476e1718dbc781337e661a2d50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MKEWP2DHFJDPZVLJUE7IBPSOP7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Strong Converse for Content Identification with Lossy Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lei Yu, Lin Zhou, Mehul Motani, Vincent Y. F. Tan","submitted_at":"2017-02-22T02:18:33Z","abstract_excerpt":"We revisit the high-dimensional content identification with lossy recovery problem (Tuncel and G\\\"und\\\"uz, 2014) and establish an exponential strong converse theorem. As a corollary of the exponential strong converse theorem, we derive an upper bound on the joint identification-error and excess-distortion exponent for the problem. Our main results can be specialized to the biometrical identification problem~(Willems, 2003) and the content identification problem~(Tuncel, 2009) since these two problems are both special cases of the content identification with lossy recovery problem. We leverage "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06649","kind":"arxiv","version":2},"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:27:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQ2mu59MQNNauF1q2qPOTYONWfcqbBXtYaQWsFwrf93M2nCpomtHVSNUV9h6UPxgFlHK5WNq9J7EFJWT5QhsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:51:18.883333Z"},"content_sha256":"f708c6799c62e26babb48f69a196e59c223537bf2593ba7e97e493af46c70ea6","schema_version":"1.0","event_id":"sha256:f708c6799c62e26babb48f69a196e59c223537bf2593ba7e97e493af46c70ea6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/bundle.json","state_url":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/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-02T07:51:18Z","links":{"resolver":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7","bundle":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/bundle.json","state":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MKEWP2DHFJDPZVLJUE7IBPSOP7","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":"d50dfea91b6575ac9218be12485fc79237f36adb11ff9b6da3fe8801b5b199ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T02:18:33Z","title_canon_sha256":"7e86e6b0a2b04253ded18a13a2853219fcaf65c706532f12c59623a87f677a2f"},"schema_version":"1.0","source":{"id":"1702.06649","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.06649","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"arxiv_version","alias_value":"1702.06649v2","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06649","created_at":"2026-05-18T00:27:21Z"},{"alias_kind":"pith_short_12","alias_value":"MKEWP2DHFJDP","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MKEWP2DHFJDPZVLJ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MKEWP2DH","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:f708c6799c62e26babb48f69a196e59c223537bf2593ba7e97e493af46c70ea6","target":"graph","created_at":"2026-05-18T00:27:21Z","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 revisit the high-dimensional content identification with lossy recovery problem (Tuncel and G\\\"und\\\"uz, 2014) and establish an exponential strong converse theorem. As a corollary of the exponential strong converse theorem, we derive an upper bound on the joint identification-error and excess-distortion exponent for the problem. Our main results can be specialized to the biometrical identification problem~(Willems, 2003) and the content identification problem~(Tuncel, 2009) since these two problems are both special cases of the content identification with lossy recovery problem. We leverage ","authors_text":"Lei Yu, Lin Zhou, Mehul Motani, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T02:18:33Z","title":"Exponential Strong Converse for Content Identification with Lossy Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.06649","kind":"arxiv","version":2},"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:3bf03b88fb050b4fe100842150715a59d4e776476e1718dbc781337e661a2d50","target":"record","created_at":"2026-05-18T00:27:21Z","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":"d50dfea91b6575ac9218be12485fc79237f36adb11ff9b6da3fe8801b5b199ba","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-22T02:18:33Z","title_canon_sha256":"7e86e6b0a2b04253ded18a13a2853219fcaf65c706532f12c59623a87f677a2f"},"schema_version":"1.0","source":{"id":"1702.06649","kind":"arxiv","version":2}},"canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","first_computed_at":"2026-05-18T00:27:21.732085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:21.732085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+JSTL4bjGnDzFZBn/+s62v5IVpdEFKKoCDVLhNI4R7zujKj/9scXlLI4Mk2eZhPqYo5Sjs1n/E6ObxMjj1/dAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:21.732740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.06649","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bf03b88fb050b4fe100842150715a59d4e776476e1718dbc781337e661a2d50","sha256:f708c6799c62e26babb48f69a196e59c223537bf2593ba7e97e493af46c70ea6"],"state_sha256":"87d145b6efe5a01b66d6fa6d27f05f4b7635582eb58a35a84a4caa245a488a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIKLaHw75Juxm1L+NS0i3KOQkHvOXbg8UbAyZLZYatyk9f5ZqacAwvdBoc2ZU1uNeKEO1ODFRyi2/Rb14tQEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:51:18.885262Z","bundle_sha256":"3f019d520214821fc8ff2b847671c9e4fde5f0fdd046dad1f76fccb40dafb611"}}