{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Y4FTSOS7NGRAZ62R6SGNYJMVJX","short_pith_number":"pith:Y4FTSOS7","schema_version":"1.0","canonical_sha256":"c70b393a5f69a20cfb51f48cdc25954dfee02a0be53cdefcec835cbed1908528","source":{"kind":"arxiv","id":"1406.5422","version":3},"attestation_state":"computed","paper":{"title":"Optimum Power Control at Finite Blocklength","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Giuseppe Durisi, Wei Yang, Yury Polyanskiy","submitted_at":"2014-06-20T15:19:07Z","abstract_excerpt":"This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-$n$ expansion of the maximal channel coding rate is characterized both for additive white Gaussian noise (AWGN) channels and for quasi-static fading channels with perfect channel state information available at both the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to $\\sqrt{n^{-1}\\ln "},"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":"1406.5422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-20T15:19:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fb6bb60030ea16e7bea45cfc89340fb963f83971137d6df6e184ddc1eda3b6d2","abstract_canon_sha256":"f21d8f7abc5220ef7214d610922e344a3424d61610bbfb0c4d2b74cac7cc5963"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:58.373241Z","signature_b64":"N/rXXKSL5ZtreZORSscSZP57IBtDfjMJNf3c3Z8BKJ3TTInXlTB7q4Wa3Dg26VpQd41riGJVja+mfmasdqHEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c70b393a5f69a20cfb51f48cdc25954dfee02a0be53cdefcec835cbed1908528","last_reissued_at":"2026-05-18T01:36:58.372684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:58.372684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum Power Control at Finite Blocklength","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Giuseppe Durisi, Wei Yang, Yury Polyanskiy","submitted_at":"2014-06-20T15:19:07Z","abstract_excerpt":"This paper investigates the maximal channel coding rate achievable at a given blocklength $n$ and error probability $\\epsilon$, when the codewords are subject to a long-term (i.e., averaged-over-all-codeword) power constraint. The second-order term in the large-$n$ expansion of the maximal channel coding rate is characterized both for additive white Gaussian noise (AWGN) channels and for quasi-static fading channels with perfect channel state information available at both the transmitter and the receiver. It is shown that in both cases the second-order term is proportional to $\\sqrt{n^{-1}\\ln "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5422","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":"1406.5422","created_at":"2026-05-18T01:36:58.372769+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5422v3","created_at":"2026-05-18T01:36:58.372769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5422","created_at":"2026-05-18T01:36:58.372769+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4FTSOS7NGRA","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4FTSOS7NGRAZ62R","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4FTSOS7","created_at":"2026-05-18T12:28:57.508820+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/Y4FTSOS7NGRAZ62R6SGNYJMVJX","json":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX.json","graph_json":"https://pith.science/api/pith-number/Y4FTSOS7NGRAZ62R6SGNYJMVJX/graph.json","events_json":"https://pith.science/api/pith-number/Y4FTSOS7NGRAZ62R6SGNYJMVJX/events.json","paper":"https://pith.science/paper/Y4FTSOS7"},"agent_actions":{"view_html":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX","download_json":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX.json","view_paper":"https://pith.science/paper/Y4FTSOS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5422&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4FTSOS7NGRAZ62R6SGNYJMVJX/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4FTSOS7NGRAZ62R6SGNYJMVJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX/action/storage_attestation","attest_author":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX/action/author_attestation","sign_citation":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX/action/citation_signature","submit_replication":"https://pith.science/pith/Y4FTSOS7NGRAZ62R6SGNYJMVJX/action/replication_record"}},"created_at":"2026-05-18T01:36:58.372769+00:00","updated_at":"2026-05-18T01:36:58.372769+00:00"}