{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TNB4VHRMYDCTBSDXNCNZA6XFYL","short_pith_number":"pith:TNB4VHRM","schema_version":"1.0","canonical_sha256":"9b43ca9e2cc0c530c877689b907ae5c2d6004a1a0523969d0b38a55d1578872f","source":{"kind":"arxiv","id":"1706.03866","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03866","created_at":"2026-05-18T00:42:28.163991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03866v1","created_at":"2026-05-18T00:42:28.163991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03866","created_at":"2026-05-18T00:42:28.163991+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNB4VHRMYDCT","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNB4VHRMYDCTBSDX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNB4VHRM","created_at":"2026-05-18T12:31:46.661854+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/TNB4VHRMYDCTBSDXNCNZA6XFYL","json":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL.json","graph_json":"https://pith.science/api/pith-number/TNB4VHRMYDCTBSDXNCNZA6XFYL/graph.json","events_json":"https://pith.science/api/pith-number/TNB4VHRMYDCTBSDXNCNZA6XFYL/events.json","paper":"https://pith.science/paper/TNB4VHRM"},"agent_actions":{"view_html":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL","download_json":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL.json","view_paper":"https://pith.science/paper/TNB4VHRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03866&json=true","fetch_graph":"https://pith.science/api/pith-number/TNB4VHRMYDCTBSDXNCNZA6XFYL/graph.json","fetch_events":"https://pith.science/api/pith-number/TNB4VHRMYDCTBSDXNCNZA6XFYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/action/storage_attestation","attest_author":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/action/author_attestation","sign_citation":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/action/citation_signature","submit_replication":"https://pith.science/pith/TNB4VHRMYDCTBSDXNCNZA6XFYL/action/replication_record"}},"created_at":"2026-05-18T00:42:28.163991+00:00","updated_at":"2026-05-18T00:42:28.163991+00:00"}