{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:C6FZ4E74GV4FKRF4O7Y5KMWIZK","short_pith_number":"pith:C6FZ4E74","canonical_record":{"source":{"id":"1611.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-26T15:28:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9a7f760ed444d385e8eb787f59684c155fbf20bdc0892100ef988f012ad237b","abstract_canon_sha256":"4fa9484570057b8f1eb5c32523bc56ef41bb0f5303c88918ee323eeab3a65bed"},"schema_version":"1.0"},"canonical_sha256":"178b9e13fc35785544bc77f1d532c8ca80407ee1db68752b159061147dff14b9","source":{"kind":"arxiv","id":"1611.08714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08714","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08714v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08714","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"C6FZ4E74GV4F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C6FZ4E74GV4FKRF4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C6FZ4E74","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:C6FZ4E74GV4FKRF4O7Y5KMWIZK","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-26T15:28:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f9a7f760ed444d385e8eb787f59684c155fbf20bdc0892100ef988f012ad237b","abstract_canon_sha256":"4fa9484570057b8f1eb5c32523bc56ef41bb0f5303c88918ee323eeab3a65bed"},"schema_version":"1.0"},"canonical_sha256":"178b9e13fc35785544bc77f1d532c8ca80407ee1db68752b159061147dff14b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.042716Z","signature_b64":"/2/VzWAzNdqdRz2l07ZWYe63B679Pl/Efd2wI5CRT9nYFLISAuBJymZRKeZYUWQCOLh0JnTblQWXaT4bjns/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"178b9e13fc35785544bc77f1d532c8ca80407ee1db68752b159061147dff14b9","last_reissued_at":"2026-05-18T00:56:37.041786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.041786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08714","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+V8IgElDHlACLVPLpLpLH6e3eEG9PnFT74zt01wyAUrGwWwWq3hZ+8lpcyPd3A118bBmtAOJOmU4vWa2D5bAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:46:32.688200Z"},"content_sha256":"771170b147911db66b019ad4db3ce73197827e50fda92dda89c008cb232b40aa","schema_version":"1.0","event_id":"sha256:771170b147911db66b019ad4db3ce73197827e50fda92dda89c008cb232b40aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:C6FZ4E74GV4FKRF4O7Y5KMWIZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-latency Ultra Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Erik G. Str\\\"om, Gianluigi Liva, Giuseppe Durisi, Henrik Sahlin, Jingya Li, Johan \\\"Ostman","submitted_at":"2016-11-26T15:28:05Z","abstract_excerpt":"Future autonomous systems require wireless connectivity able to support extremely stringent requirements on both latency and reliability. In this paper, we leverage recent developments in the field of finite-blocklength information theory to illustrate how to optimally design wireless systems in the presence of such stringent constraints. Focusing on a multi-antenna Rayleigh block-fading channel, we obtain bounds on the maximum number of bits that can be transmitted within given bandwidth, latency, and reliability constraints, using an orthogonal frequency-division multiplexing system similar "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08714","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OisHjBk7FiEM6wHZvXU6iE3tsanG1NwnueNV0SITrAvpwLirjMRfuJmbs4GayxXdH7CcNESTPSrd4MSxPW8ICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:46:32.688905Z"},"content_sha256":"34cd6d6b271b60cb30dacb5d4786b11ce689d4956fe3fcb60d91cb4a9a2b9d29","schema_version":"1.0","event_id":"sha256:34cd6d6b271b60cb30dacb5d4786b11ce689d4956fe3fcb60d91cb4a9a2b9d29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/bundle.json","state_url":"https://pith.science/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/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-05T03:46:32Z","links":{"resolver":"https://pith.science/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK","bundle":"https://pith.science/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/bundle.json","state":"https://pith.science/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C6FZ4E74GV4FKRF4O7Y5KMWIZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C6FZ4E74GV4FKRF4O7Y5KMWIZK","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":"4fa9484570057b8f1eb5c32523bc56ef41bb0f5303c88918ee323eeab3a65bed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-26T15:28:05Z","title_canon_sha256":"f9a7f760ed444d385e8eb787f59684c155fbf20bdc0892100ef988f012ad237b"},"schema_version":"1.0","source":{"id":"1611.08714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08714","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08714v1","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08714","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"C6FZ4E74GV4F","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C6FZ4E74GV4FKRF4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C6FZ4E74","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:34cd6d6b271b60cb30dacb5d4786b11ce689d4956fe3fcb60d91cb4a9a2b9d29","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"Future autonomous systems require wireless connectivity able to support extremely stringent requirements on both latency and reliability. In this paper, we leverage recent developments in the field of finite-blocklength information theory to illustrate how to optimally design wireless systems in the presence of such stringent constraints. Focusing on a multi-antenna Rayleigh block-fading channel, we obtain bounds on the maximum number of bits that can be transmitted within given bandwidth, latency, and reliability constraints, using an orthogonal frequency-division multiplexing system similar ","authors_text":"Erik G. Str\\\"om, Gianluigi Liva, Giuseppe Durisi, Henrik Sahlin, Jingya Li, Johan \\\"Ostman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-26T15:28:05Z","title":"Low-latency Ultra Reliable 5G Communications: Finite-Blocklength Bounds and Coding Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08714","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:771170b147911db66b019ad4db3ce73197827e50fda92dda89c008cb232b40aa","target":"record","created_at":"2026-05-18T00:56:37Z","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":"4fa9484570057b8f1eb5c32523bc56ef41bb0f5303c88918ee323eeab3a65bed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-26T15:28:05Z","title_canon_sha256":"f9a7f760ed444d385e8eb787f59684c155fbf20bdc0892100ef988f012ad237b"},"schema_version":"1.0","source":{"id":"1611.08714","kind":"arxiv","version":1}},"canonical_sha256":"178b9e13fc35785544bc77f1d532c8ca80407ee1db68752b159061147dff14b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"178b9e13fc35785544bc77f1d532c8ca80407ee1db68752b159061147dff14b9","first_computed_at":"2026-05-18T00:56:37.041786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.041786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/2/VzWAzNdqdRz2l07ZWYe63B679Pl/Efd2wI5CRT9nYFLISAuBJymZRKeZYUWQCOLh0JnTblQWXaT4bjns/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.042716Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:771170b147911db66b019ad4db3ce73197827e50fda92dda89c008cb232b40aa","sha256:34cd6d6b271b60cb30dacb5d4786b11ce689d4956fe3fcb60d91cb4a9a2b9d29"],"state_sha256":"40337501840fd7ac8d838a54e7bbd021c7489b09696279f66ede8981aaf1f5a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wL863XFtzLaiqx+6mipCFXD3REgIYFCYjr/GovsHsiKO8eOhj4HYhu5Q/mlV9nrXodJ1hEo+d3RnswhSdoUeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:46:32.692508Z","bundle_sha256":"045e8cd514d390e059a22595654955886b7245b15de3fb7068cf7a4203ae2879"}}