{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZUUKWPGLPBKE6ZNXTGAJD37SEU","short_pith_number":"pith:ZUUKWPGL","schema_version":"1.0","canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","source":{"kind":"arxiv","id":"1708.05685","version":3},"attestation_state":"computed","paper":{"title":"On privacy amplification, lossy compression, and their duality to channel coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Joseph M. Renes","submitted_at":"2017-08-18T16:40:26Z","abstract_excerpt":"We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in terms of the optimal type-II error in asymmetric hypothesis testing. This formulation can be easily computed to give finite-blocklength bounds and turns out to be equivalent to smooth min-entropy bounds by Renner and Wolf [Asiacrypt 2005] and Watanabe and Hayashi [ISIT 2013], as well as a bound in terms of the $E_\\gamma$ divergence by Yang, Schaefer, and Poor "},"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":"1708.05685","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T16:40:26Z","cross_cats_sorted":["math.IT","quant-ph"],"title_canon_sha256":"c9bec3935d86391e93efd9dd1cdc280c504439ba8827aa1404033e97d3d756b6","abstract_canon_sha256":"5a763288c1f3315cc7bcf530df098bc64e12213eece7824600ff1172394662c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:09.142571Z","signature_b64":"30X+4QA3EtPFuifbVWvq2pPqXiFI0dxN/n3OT/UoXNBWYjdvbD5ColsDeA0/XlnNVYgVxlNTSqTXPwNMlL7/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","last_reissued_at":"2026-05-18T00:00:09.142062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:09.142062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On privacy amplification, lossy compression, and their duality to channel coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Joseph M. Renes","submitted_at":"2017-08-18T16:40:26Z","abstract_excerpt":"We examine the task of privacy amplification from information-theoretic and coding-theoretic points of view. In the former, we give a one-shot characterization of the optimal rate of privacy amplification against classical adversaries in terms of the optimal type-II error in asymmetric hypothesis testing. This formulation can be easily computed to give finite-blocklength bounds and turns out to be equivalent to smooth min-entropy bounds by Renner and Wolf [Asiacrypt 2005] and Watanabe and Hayashi [ISIT 2013], as well as a bound in terms of the $E_\\gamma$ divergence by Yang, Schaefer, and Poor "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05685","kind":"arxiv","version":3},"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":"1708.05685","created_at":"2026-05-18T00:00:09.142148+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05685v3","created_at":"2026-05-18T00:00:09.142148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05685","created_at":"2026-05-18T00:00:09.142148+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZUUKWPGLPBKE","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZUUKWPGLPBKE6ZNX","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZUUKWPGL","created_at":"2026-05-18T12:31:59.375834+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/ZUUKWPGLPBKE6ZNXTGAJD37SEU","json":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU.json","graph_json":"https://pith.science/api/pith-number/ZUUKWPGLPBKE6ZNXTGAJD37SEU/graph.json","events_json":"https://pith.science/api/pith-number/ZUUKWPGLPBKE6ZNXTGAJD37SEU/events.json","paper":"https://pith.science/paper/ZUUKWPGL"},"agent_actions":{"view_html":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU","download_json":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU.json","view_paper":"https://pith.science/paper/ZUUKWPGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05685&json=true","fetch_graph":"https://pith.science/api/pith-number/ZUUKWPGLPBKE6ZNXTGAJD37SEU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZUUKWPGLPBKE6ZNXTGAJD37SEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/action/storage_attestation","attest_author":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/action/author_attestation","sign_citation":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/action/citation_signature","submit_replication":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/action/replication_record"}},"created_at":"2026-05-18T00:00:09.142148+00:00","updated_at":"2026-05-18T00:00:09.142148+00:00"}