{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZUUKWPGLPBKE6ZNXTGAJD37SEU","short_pith_number":"pith:ZUUKWPGL","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"},"canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","source":{"kind":"arxiv","id":"1708.05685","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05685","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05685v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05685","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUKWPGLPBKE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUKWPGLPBKE6ZNX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUKWPGL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZUUKWPGLPBKE6ZNXTGAJD37SEU","target":"record","payload":{"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"},"canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","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"},"source_kind":"arxiv","source_id":"1708.05685","source_version":3,"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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0UuQKDrRDutNCUxORB8LLvKoKPP1Jl2bJWHq9qyoxCLA3TEuHZbphj837ToBWJNwRvjLfmEskiIJulD3aWKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:42:41.036634Z"},"content_sha256":"faffa14d800e018c271f6da97208289f06181810d7adac4f33f72483793d8c5e","schema_version":"1.0","event_id":"sha256:faffa14d800e018c271f6da97208289f06181810d7adac4f33f72483793d8c5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZUUKWPGLPBKE6ZNXTGAJD37SEU","target":"graph","payload":{"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"},"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:00:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s41MFZP8uXWHQdWD6P8bPfwu1fp8F2nu5OYAMiE3jI5sJmgfCJwjUtkZD68Nwrx6xwc0xkKjsxg1P+5uf032BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:42:41.037001Z"},"content_sha256":"ab5da869ed71b6ea61dd02340f1456be8bab09d1e732b14bb6a69818a2538b12","schema_version":"1.0","event_id":"sha256:ab5da869ed71b6ea61dd02340f1456be8bab09d1e732b14bb6a69818a2538b12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/bundle.json","state_url":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/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-28T09:42:41Z","links":{"resolver":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU","bundle":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/bundle.json","state":"https://pith.science/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZUUKWPGLPBKE6ZNXTGAJD37SEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZUUKWPGLPBKE6ZNXTGAJD37SEU","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":"5a763288c1f3315cc7bcf530df098bc64e12213eece7824600ff1172394662c2","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T16:40:26Z","title_canon_sha256":"c9bec3935d86391e93efd9dd1cdc280c504439ba8827aa1404033e97d3d756b6"},"schema_version":"1.0","source":{"id":"1708.05685","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05685","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05685v3","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05685","created_at":"2026-05-18T00:00:09Z"},{"alias_kind":"pith_short_12","alias_value":"ZUUKWPGLPBKE","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZUUKWPGLPBKE6ZNX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZUUKWPGL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ab5da869ed71b6ea61dd02340f1456be8bab09d1e732b14bb6a69818a2538b12","target":"graph","created_at":"2026-05-18T00:00:09Z","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 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 ","authors_text":"Joseph M. Renes","cross_cats":["math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T16:40:26Z","title":"On privacy amplification, lossy compression, and their duality to channel coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05685","kind":"arxiv","version":3},"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:faffa14d800e018c271f6da97208289f06181810d7adac4f33f72483793d8c5e","target":"record","created_at":"2026-05-18T00:00:09Z","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":"5a763288c1f3315cc7bcf530df098bc64e12213eece7824600ff1172394662c2","cross_cats_sorted":["math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-18T16:40:26Z","title_canon_sha256":"c9bec3935d86391e93efd9dd1cdc280c504439ba8827aa1404033e97d3d756b6"},"schema_version":"1.0","source":{"id":"1708.05685","kind":"arxiv","version":3}},"canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd28ab3ccb78544f65b7998091eff22520da6fba6c857203e36d7f23fd250274","first_computed_at":"2026-05-18T00:00:09.142062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:09.142062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"30X+4QA3EtPFuifbVWvq2pPqXiFI0dxN/n3OT/UoXNBWYjdvbD5ColsDeA0/XlnNVYgVxlNTSqTXPwNMlL7/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:09.142571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05685","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faffa14d800e018c271f6da97208289f06181810d7adac4f33f72483793d8c5e","sha256:ab5da869ed71b6ea61dd02340f1456be8bab09d1e732b14bb6a69818a2538b12"],"state_sha256":"2ff7743b3a3c22cc79fea6d98cd04020985f4648e4e61964b4abc7bbfe3c27db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vedQLPsX91Bhe5QsrZf+ke1sUuF8aUrC45+b3+telCssh7PBDho/3J4QFYRIfZaPhjO6w6Cs5y52ldej65bZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:42:41.039107Z","bundle_sha256":"478d534bb49b15a9d6f2a817d6efa68be26cd2411469e8eb1219a26e2d0c0919"}}