{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6DCBEYPU2XOEP2XTDBQVXRV4YP","short_pith_number":"pith:6DCBEYPU","schema_version":"1.0","canonical_sha256":"f0c41261f4d5dc47eaf318615bc6bcc3d18d4731187ef835a2dd122b925a5d29","source":{"kind":"arxiv","id":"1903.05804","version":1},"attestation_state":"computed","paper":{"title":"Queue-Aware Variable-Length Coding for Ultra Reliable Low Latency Communications with Random Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Wei Chen, Xiaoyu Zhao","submitted_at":"2019-03-14T03:38:19Z","abstract_excerpt":"With the phenomenal growth of the Internet of Things (IoT), Ultra Reliable Low Latency Communications (URLLC) has potentially been the enabler to guarantee the stringent requirements on latency and reliability. However, how to achieve low latency and ultra-reliability with the random arrival remains open. In this paper, a queue-aware variable-length channel coding is presented over the single URLLC user link, in which the finite blocklength of channel coding is determined based on the random arrival. More particularly, a cross-layer approach is proposed for the URLLC user to establish the opti"},"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":"1903.05804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-14T03:38:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99b0be47b84483fc68fea681a0e54f0af5e3959d1b263375838ab9a946f35438","abstract_canon_sha256":"a344e4d27340eccd0c0b00f428d715814537e40dbfd3d25fc5fc4351ed0db8f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:16.171221Z","signature_b64":"ZrIl3FEdYxygdzeBp+F69UbMWgqgRIFCuEbvrwUsfuISJjoQK3lwe/XroDB4JsEe0BPgLhun1JL/gsK8FogwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0c41261f4d5dc47eaf318615bc6bcc3d18d4731187ef835a2dd122b925a5d29","last_reissued_at":"2026-05-17T23:51:16.170604Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:16.170604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Queue-Aware Variable-Length Coding for Ultra Reliable Low Latency Communications with Random Arrival","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Wei Chen, Xiaoyu Zhao","submitted_at":"2019-03-14T03:38:19Z","abstract_excerpt":"With the phenomenal growth of the Internet of Things (IoT), Ultra Reliable Low Latency Communications (URLLC) has potentially been the enabler to guarantee the stringent requirements on latency and reliability. However, how to achieve low latency and ultra-reliability with the random arrival remains open. In this paper, a queue-aware variable-length channel coding is presented over the single URLLC user link, in which the finite blocklength of channel coding is determined based on the random arrival. More particularly, a cross-layer approach is proposed for the URLLC user to establish the opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05804","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":"1903.05804","created_at":"2026-05-17T23:51:16.170688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05804v1","created_at":"2026-05-17T23:51:16.170688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05804","created_at":"2026-05-17T23:51:16.170688+00:00"},{"alias_kind":"pith_short_12","alias_value":"6DCBEYPU2XOE","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6DCBEYPU2XOEP2XT","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6DCBEYPU","created_at":"2026-05-18T12:33:10.108867+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/6DCBEYPU2XOEP2XTDBQVXRV4YP","json":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP.json","graph_json":"https://pith.science/api/pith-number/6DCBEYPU2XOEP2XTDBQVXRV4YP/graph.json","events_json":"https://pith.science/api/pith-number/6DCBEYPU2XOEP2XTDBQVXRV4YP/events.json","paper":"https://pith.science/paper/6DCBEYPU"},"agent_actions":{"view_html":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP","download_json":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP.json","view_paper":"https://pith.science/paper/6DCBEYPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05804&json=true","fetch_graph":"https://pith.science/api/pith-number/6DCBEYPU2XOEP2XTDBQVXRV4YP/graph.json","fetch_events":"https://pith.science/api/pith-number/6DCBEYPU2XOEP2XTDBQVXRV4YP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP/action/storage_attestation","attest_author":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP/action/author_attestation","sign_citation":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP/action/citation_signature","submit_replication":"https://pith.science/pith/6DCBEYPU2XOEP2XTDBQVXRV4YP/action/replication_record"}},"created_at":"2026-05-17T23:51:16.170688+00:00","updated_at":"2026-05-17T23:51:16.170688+00:00"}