{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P3VUWOJLG66VRJTCC6SXNJTOEP","short_pith_number":"pith:P3VUWOJL","canonical_record":{"source":{"id":"1802.09166","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-26T05:17:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df6c0ecd2a86433b449a0921d2204fe43887c97e3f8077bf7cce002c27af7fac","abstract_canon_sha256":"13ccfc46f2008fc174933a08603c76f6158c6d9a9e0a9b51aa3353e0c02197f7"},"schema_version":"1.0"},"canonical_sha256":"7eeb4b392b37bd58a66217a576a66e23f90bf533b39c814033dbcb889dc5b7e1","source":{"kind":"arxiv","id":"1802.09166","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09166","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09166v4","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09166","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"P3VUWOJLG66V","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3VUWOJLG66VRJTC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3VUWOJL","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P3VUWOJLG66VRJTCC6SXNJTOEP","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09166","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-26T05:17:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"df6c0ecd2a86433b449a0921d2204fe43887c97e3f8077bf7cce002c27af7fac","abstract_canon_sha256":"13ccfc46f2008fc174933a08603c76f6158c6d9a9e0a9b51aa3353e0c02197f7"},"schema_version":"1.0"},"canonical_sha256":"7eeb4b392b37bd58a66217a576a66e23f90bf533b39c814033dbcb889dc5b7e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.164432Z","signature_b64":"c9nprkvc5Nh/V76bzFdZrUtaZZxKdcFK27iPt/Bh8DQMHJr3uJU71IV7yNvbBlyT3QqGEZvmMTObJIbxBqltDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7eeb4b392b37bd58a66217a576a66e23f90bf533b39c814033dbcb889dc5b7e1","last_reissued_at":"2026-05-18T00:06:25.163862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.163862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09166","source_version":4,"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:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZciKN5Skn5mk6hkt4PB08ZNFJvZ7+dydffKb8D9uY9cbji+9wfEqWJkwBGeupYW43I424h7WFkUP6YU+TNyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:51.849515Z"},"content_sha256":"efacf0fc438cbb4c9bfad2c5b0078b75b2f642d13b9b681f72bd3d94ed96d845","schema_version":"1.0","event_id":"sha256:efacf0fc438cbb4c9bfad2c5b0078b75b2f642d13b9b681f72bd3d94ed96d845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P3VUWOJLG66VRJTCC6SXNJTOEP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Block-length Codes for Ultra-Reliable Low-Latency Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aleksandar Minja, Balazs Matuz, Branka Vucetic, Chentao Yue, Guojun Han, Mahyar Shirvanimoghaddam, Mohamad Sadegh Mohamadi, Rana Abbas, Sarah Johnson, Yonghui Li, Zihuai Lin","submitted_at":"2018-02-26T05:17:23Z","abstract_excerpt":"This paper reviews the state of the art channel coding techniques for ultra-reliable low latency communication (URLLC). The stringent requirements of URLLC services, such as ultra-high reliability and low latency, have made it the most challenging feature of the fifth generation (5G) mobile systems. The problem is even more challenging for the services beyond the 5G promise, such as tele-surgery and factory automation, which require latencies less than 1ms and failure rate as low as $10^{-9}$. The very low latency requirements of URLLC do not allow traditional approaches such as re-transmissio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09166","kind":"arxiv","version":4},"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:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxE+I/F1sepL4oKlINhdXZqDu72aoKuV1He49gjsVQDAQoIQHhHP3apPyzTGo2vFwABah5xunbrzdTv+o9qPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:47:51.850086Z"},"content_sha256":"e684b41a5f8d0f66d11df4d42446f22ed882788f01e514925fc495dfca7aa6ef","schema_version":"1.0","event_id":"sha256:e684b41a5f8d0f66d11df4d42446f22ed882788f01e514925fc495dfca7aa6ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/bundle.json","state_url":"https://pith.science/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/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-05-25T15:47:51Z","links":{"resolver":"https://pith.science/pith/P3VUWOJLG66VRJTCC6SXNJTOEP","bundle":"https://pith.science/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/bundle.json","state":"https://pith.science/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3VUWOJLG66VRJTCC6SXNJTOEP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P3VUWOJLG66VRJTCC6SXNJTOEP","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":"13ccfc46f2008fc174933a08603c76f6158c6d9a9e0a9b51aa3353e0c02197f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-26T05:17:23Z","title_canon_sha256":"df6c0ecd2a86433b449a0921d2204fe43887c97e3f8077bf7cce002c27af7fac"},"schema_version":"1.0","source":{"id":"1802.09166","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09166","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09166v4","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09166","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"P3VUWOJLG66V","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P3VUWOJLG66VRJTC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P3VUWOJL","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e684b41a5f8d0f66d11df4d42446f22ed882788f01e514925fc495dfca7aa6ef","target":"graph","created_at":"2026-05-18T00:06:25Z","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 reviews the state of the art channel coding techniques for ultra-reliable low latency communication (URLLC). The stringent requirements of URLLC services, such as ultra-high reliability and low latency, have made it the most challenging feature of the fifth generation (5G) mobile systems. The problem is even more challenging for the services beyond the 5G promise, such as tele-surgery and factory automation, which require latencies less than 1ms and failure rate as low as $10^{-9}$. The very low latency requirements of URLLC do not allow traditional approaches such as re-transmissio","authors_text":"Aleksandar Minja, Balazs Matuz, Branka Vucetic, Chentao Yue, Guojun Han, Mahyar Shirvanimoghaddam, Mohamad Sadegh Mohamadi, Rana Abbas, Sarah Johnson, Yonghui Li, Zihuai Lin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-26T05:17:23Z","title":"Short Block-length Codes for Ultra-Reliable Low-Latency Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09166","kind":"arxiv","version":4},"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:efacf0fc438cbb4c9bfad2c5b0078b75b2f642d13b9b681f72bd3d94ed96d845","target":"record","created_at":"2026-05-18T00:06:25Z","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":"13ccfc46f2008fc174933a08603c76f6158c6d9a9e0a9b51aa3353e0c02197f7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-26T05:17:23Z","title_canon_sha256":"df6c0ecd2a86433b449a0921d2204fe43887c97e3f8077bf7cce002c27af7fac"},"schema_version":"1.0","source":{"id":"1802.09166","kind":"arxiv","version":4}},"canonical_sha256":"7eeb4b392b37bd58a66217a576a66e23f90bf533b39c814033dbcb889dc5b7e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7eeb4b392b37bd58a66217a576a66e23f90bf533b39c814033dbcb889dc5b7e1","first_computed_at":"2026-05-18T00:06:25.163862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:25.163862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c9nprkvc5Nh/V76bzFdZrUtaZZxKdcFK27iPt/Bh8DQMHJr3uJU71IV7yNvbBlyT3QqGEZvmMTObJIbxBqltDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:25.164432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09166","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efacf0fc438cbb4c9bfad2c5b0078b75b2f642d13b9b681f72bd3d94ed96d845","sha256:e684b41a5f8d0f66d11df4d42446f22ed882788f01e514925fc495dfca7aa6ef"],"state_sha256":"b17a1b96f2cdd4a3f3648ce9eff9145ceff5075f8d638166f4bd579e2832fd3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXdL+HkTcnvOwiAjYSOlTQG5CoBpCIETbO3i+MCY00MOZpASKPnwdWLSBbIhyQ9ttILODi8QzLexyX0MYW6CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:47:51.852799Z","bundle_sha256":"eb5f4bcf3328746705c1e86ae911bf935c632bdf235646fbfdbc0a20af968976"}}