{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TNB4VHRMYDCTBSDXNCNZA6XFYL","short_pith_number":"pith:TNB4VHRM","canonical_record":{"source":{"id":"1706.03866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T22:45:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5860d9a0b7e6a19a6405c15bd7739fe668c5ed3dec6ab28639f96e84fa716797","abstract_canon_sha256":"8952552291a8eba1943d8b08348b8819496bee71bd363c6a53c129f73391dd8a"},"schema_version":"1.0"},"canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","source":{"kind":"arxiv","id":"1706.03866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03866","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03866v1","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03866","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"TNB4VHRMYDCT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNB4VHRMYDCTBSDX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNB4VHRM","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TNB4VHRMYDCTBSDXNCNZA6XFYL","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T22:45:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5860d9a0b7e6a19a6405c15bd7739fe668c5ed3dec6ab28639f96e84fa716797","abstract_canon_sha256":"8952552291a8eba1943d8b08348b8819496bee71bd363c6a53c129f73391dd8a"},"schema_version":"1.0"},"canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:28.164584Z","signature_b64":"msyyJHXv87oqR8nw4bLWEYbE1zP+9Mg7VDEYcmVQy/y5lp2RhYIsGqWyKyewFhQGI6XiqGWXSsH1alSkxSkCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","last_reissued_at":"2026-05-18T00:42:28.163884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:28.163884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03866","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-18T00:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ANb3tJ5FIS8xwe8Bvj6nZeZzsOeuqE6oom8HWlgI9/bw4qqTikSyRh9XcokytO/z15K8T5Z+MeY6jSpGwanaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:18:21.437002Z"},"content_sha256":"da3ce25fefa1eec224cc29a5aff9609c8d0dabdd746f130782d94e25a188eeb2","schema_version":"1.0","event_id":"sha256:da3ce25fefa1eec224cc29a5aff9609c8d0dabdd746f130782d94e25a188eeb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TNB4VHRMYDCTBSDXNCNZA6XFYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wiretap Channels: Nonasymptotic Fundamental Limits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"H. Vincent Poor, Rafael F. Schaefer, Wei Yang","submitted_at":"2017-06-12T22:45:52Z","abstract_excerpt":"This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievabili"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03866","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-18T00:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJz1ImAQEpIKE7iIlDa7bSibMIdNA/wluQRJhnpIqZyQILfY3i/hgeYihtlttWoP3hqnra2RHS61kSlczVWDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T08:18:21.437364Z"},"content_sha256":"4d422eaee82690c1241af3e028b9120744f5e6d977fe898353b48a39c2002e53","schema_version":"1.0","event_id":"sha256:4d422eaee82690c1241af3e028b9120744f5e6d977fe898353b48a39c2002e53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/bundle.json","state_url":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/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-12T08:18:21Z","links":{"resolver":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL","bundle":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/bundle.json","state":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TNB4VHRMYDCTBSDXNCNZA6XFYL","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":"8952552291a8eba1943d8b08348b8819496bee71bd363c6a53c129f73391dd8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T22:45:52Z","title_canon_sha256":"5860d9a0b7e6a19a6405c15bd7739fe668c5ed3dec6ab28639f96e84fa716797"},"schema_version":"1.0","source":{"id":"1706.03866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03866","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03866v1","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03866","created_at":"2026-05-18T00:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"TNB4VHRMYDCT","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNB4VHRMYDCTBSDX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNB4VHRM","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:4d422eaee82690c1241af3e028b9120744f5e6d977fe898353b48a39c2002e53","target":"graph","created_at":"2026-05-18T00:42:28Z","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":"This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievabili","authors_text":"H. Vincent Poor, Rafael F. Schaefer, Wei Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T22:45:52Z","title":"Wiretap Channels: Nonasymptotic Fundamental Limits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03866","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:da3ce25fefa1eec224cc29a5aff9609c8d0dabdd746f130782d94e25a188eeb2","target":"record","created_at":"2026-05-18T00:42:28Z","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":"8952552291a8eba1943d8b08348b8819496bee71bd363c6a53c129f73391dd8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-06-12T22:45:52Z","title_canon_sha256":"5860d9a0b7e6a19a6405c15bd7739fe668c5ed3dec6ab28639f96e84fa716797"},"schema_version":"1.0","source":{"id":"1706.03866","kind":"arxiv","version":1}},"canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","first_computed_at":"2026-05-18T00:42:28.163884Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:28.163884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"msyyJHXv87oqR8nw4bLWEYbE1zP+9Mg7VDEYcmVQy/y5lp2RhYIsGqWyKyewFhQGI6XiqGWXSsH1alSkxSkCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:28.164584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da3ce25fefa1eec224cc29a5aff9609c8d0dabdd746f130782d94e25a188eeb2","sha256:4d422eaee82690c1241af3e028b9120744f5e6d977fe898353b48a39c2002e53"],"state_sha256":"0e91fc69b821f17bd5c2b3d9ec73ea14bf4c0bfa33341adae410fe9028ab255a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK2ijqVlHURNHwSgwCRfumAU7laddU1d1fH3RZ0kk3pmBvqDyQfpnerJpZTGyqw+bHtPBtHQRwakQOs2YE12Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T08:18:21.439336Z","bundle_sha256":"3b7346a9d44ef5e0b839dd2d695b4ed9f9030494dbfb020f8aa90a7110d1f623"}}