{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MKEWP2DHFJDPZVLJUE7IBPSOP7","short_pith_number":"pith:MKEWP2DH","schema_version":"1.0","canonical_sha256":"628967e8672a46fcd569a13e80be4e7feacac116d15fcdf7e8e2b5043dad2bec","source":{"kind":"arxiv","id":"1702.06649","version":2},"attestation_state":"computed","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 "},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.06649","created_at":"2026-05-18T00:27:21.732179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.06649v2","created_at":"2026-05-18T00:27:21.732179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.06649","created_at":"2026-05-18T00:27:21.732179+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKEWP2DHFJDP","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKEWP2DHFJDPZVLJ","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKEWP2DH","created_at":"2026-05-18T12:31:31.346846+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/MKEWP2DHFJDPZVLJUE7IBPSOP7","json":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7.json","graph_json":"https://pith.science/api/pith-number/MKEWP2DHFJDPZVLJUE7IBPSOP7/graph.json","events_json":"https://pith.science/api/pith-number/MKEWP2DHFJDPZVLJUE7IBPSOP7/events.json","paper":"https://pith.science/paper/MKEWP2DH"},"agent_actions":{"view_html":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7","download_json":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7.json","view_paper":"https://pith.science/paper/MKEWP2DH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.06649&json=true","fetch_graph":"https://pith.science/api/pith-number/MKEWP2DHFJDPZVLJUE7IBPSOP7/graph.json","fetch_events":"https://pith.science/api/pith-number/MKEWP2DHFJDPZVLJUE7IBPSOP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/action/storage_attestation","attest_author":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/action/author_attestation","sign_citation":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/action/citation_signature","submit_replication":"https://pith.science/pith/MKEWP2DHFJDPZVLJUE7IBPSOP7/action/replication_record"}},"created_at":"2026-05-18T00:27:21.732179+00:00","updated_at":"2026-05-18T00:27:21.732179+00:00"}