{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OVHEXLUCW4Y4XKP7XIE5GNENGE","short_pith_number":"pith:OVHEXLUC","schema_version":"1.0","canonical_sha256":"754e4bae82b731cba9ffba09d3348d31108475b1a097fb535a0822fc15df114c","source":{"kind":"arxiv","id":"1412.7512","version":3},"attestation_state":"computed","paper":{"title":"Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Tobias Koch, Wei Yang, Yury Polyanskiy","submitted_at":"2014-12-23T20:41:36Z","abstract_excerpt":"Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols)"},"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":"1412.7512","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-23T20:41:36Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a1a2646c631f644f20638758aee728ea996e7d939c4d16aa3bd865b3bd786438","abstract_canon_sha256":"d0a785cd91e58d4043255a15be893a4d2afd158883f53ca6a3fc892740d22845"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.398178Z","signature_b64":"mAfaBHqlQ0RvkkO5yq2FdfhZIGS/YzOrkmRCCwp7fPugiT4ej8H0Sr1FLCviVeEeu7J1qcArbgIZ9a6pXxcTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"754e4bae82b731cba9ffba09d3348d31108475b1a097fb535a0822fc15df114c","last_reissued_at":"2026-05-18T00:58:36.397563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.397563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Durisi, Johan \\\"Ostman, Tobias Koch, Wei Yang, Yury Polyanskiy","submitted_at":"2014-12-23T20:41:36Z","abstract_excerpt":"Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh block-fading channels. Specifically, we obtain finite-blocklength, finite-SNR upper and lower bounds on the maximum coding rate achievable over such channels for a given constraint on the packet error probability. Numerical evidence suggests that our bounds delimit tightly the maximum coding rate already for short blocklengths (packets of about 100 symbols)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7512","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":"1412.7512","created_at":"2026-05-18T00:58:36.397662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7512v3","created_at":"2026-05-18T00:58:36.397662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7512","created_at":"2026-05-18T00:58:36.397662+00:00"},{"alias_kind":"pith_short_12","alias_value":"OVHEXLUCW4Y4","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OVHEXLUCW4Y4XKP7","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OVHEXLUC","created_at":"2026-05-18T12:28:43.426989+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/OVHEXLUCW4Y4XKP7XIE5GNENGE","json":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE.json","graph_json":"https://pith.science/api/pith-number/OVHEXLUCW4Y4XKP7XIE5GNENGE/graph.json","events_json":"https://pith.science/api/pith-number/OVHEXLUCW4Y4XKP7XIE5GNENGE/events.json","paper":"https://pith.science/paper/OVHEXLUC"},"agent_actions":{"view_html":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE","download_json":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE.json","view_paper":"https://pith.science/paper/OVHEXLUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7512&json=true","fetch_graph":"https://pith.science/api/pith-number/OVHEXLUCW4Y4XKP7XIE5GNENGE/graph.json","fetch_events":"https://pith.science/api/pith-number/OVHEXLUCW4Y4XKP7XIE5GNENGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE/action/storage_attestation","attest_author":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE/action/author_attestation","sign_citation":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE/action/citation_signature","submit_replication":"https://pith.science/pith/OVHEXLUCW4Y4XKP7XIE5GNENGE/action/replication_record"}},"created_at":"2026-05-18T00:58:36.397662+00:00","updated_at":"2026-05-18T00:58:36.397662+00:00"}