{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PSFUIFXUYCGF5O67U5MUBIC5KS","short_pith_number":"pith:PSFUIFXU","canonical_record":{"source":{"id":"1703.09575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T13:52:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1f9c9125903398f80170526419786435f9da19dd7861243e408ba47386d29073","abstract_canon_sha256":"dcd6a2ec0265eec0711928067750a49b8d2d69438cb2b2d69a25345bd5911473"},"schema_version":"1.0"},"canonical_sha256":"7c8b4416f4c08c5ebbdfa75940a05d54b29c67f1c891a46adfc0d9f1789d441a","source":{"kind":"arxiv","id":"1703.09575","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09575","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09575v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09575","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"PSFUIFXUYCGF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSFUIFXUYCGF5O67","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSFUIFXU","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PSFUIFXUYCGF5O67U5MUBIC5KS","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09575","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T13:52:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1f9c9125903398f80170526419786435f9da19dd7861243e408ba47386d29073","abstract_canon_sha256":"dcd6a2ec0265eec0711928067750a49b8d2d69438cb2b2d69a25345bd5911473"},"schema_version":"1.0"},"canonical_sha256":"7c8b4416f4c08c5ebbdfa75940a05d54b29c67f1c891a46adfc0d9f1789d441a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:32.170380Z","signature_b64":"T2LiPH/M/x2+B5e7lGvQoFYBnlJawiMdcib4wK8yaDHV1bwKdCEuj187WSOT0NPIYqEyGzVtTsFl0NNfffAwBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c8b4416f4c08c5ebbdfa75940a05d54b29c67f1c891a46adfc0d9f1789d441a","last_reissued_at":"2026-05-18T00:33:32.169746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:32.169746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09575","source_version":2,"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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18z6jOUI7v4YLA7xH1qiroruPYUxO6sEiETJS6MLoYVz0O3THfbEvkLFhdW/Ie83L/4QoeyE/feipoIGUdN9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:50.280601Z"},"content_sha256":"76f9957dfc45d0b5ce266a5175c127c56bc9b6374d584ce63a70474ee882f934","schema_version":"1.0","event_id":"sha256:76f9957dfc45d0b5ce266a5175c127c56bc9b6374d584ce63a70474ee882f934"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PSFUIFXUYCGF5O67U5MUBIC5KS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-layer Optimization for Ultra-reliable and Low-latency Radio Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Changyang She, Chenyang Yang, Tony Q.S. Quek","submitted_at":"2017-03-28T13:52:40Z","abstract_excerpt":"In this paper, we propose a framework for cross-layer optimization to ensure ultra-high reliability and ultra-low latency in radio access networks, where both transmission delay and queueing delay are considered. With short transmission time, the blocklength of channel codes is finite, and the Shannon Capacity cannot be used to characterize the maximal achievable rate with given transmission error probability. With randomly arrived packets, some packets may violate the queueing delay. Moreover, since the queueing delay is shorter than the channel coherence time in typical scenarios, the requir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09575","kind":"arxiv","version":2},"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:33:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XwJ+2DGHa07JBg77ggtHhV/xzzybq4Hcw4+ohQvho1l4DnucHJnoRr4cgKqBdqtJhCCEmY8U38sTBVTbsNCADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:42:50.280964Z"},"content_sha256":"0199aada90555bb45ff599161b651cb4f8300d7e5644c8e9eb9d48b82ff1c6c6","schema_version":"1.0","event_id":"sha256:0199aada90555bb45ff599161b651cb4f8300d7e5644c8e9eb9d48b82ff1c6c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/bundle.json","state_url":"https://pith.science/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/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-26T15:42:50Z","links":{"resolver":"https://pith.science/pith/PSFUIFXUYCGF5O67U5MUBIC5KS","bundle":"https://pith.science/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/bundle.json","state":"https://pith.science/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSFUIFXUYCGF5O67U5MUBIC5KS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PSFUIFXUYCGF5O67U5MUBIC5KS","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":"dcd6a2ec0265eec0711928067750a49b8d2d69438cb2b2d69a25345bd5911473","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T13:52:40Z","title_canon_sha256":"1f9c9125903398f80170526419786435f9da19dd7861243e408ba47386d29073"},"schema_version":"1.0","source":{"id":"1703.09575","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09575","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09575v2","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09575","created_at":"2026-05-18T00:33:32Z"},{"alias_kind":"pith_short_12","alias_value":"PSFUIFXUYCGF","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PSFUIFXUYCGF5O67","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PSFUIFXU","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:0199aada90555bb45ff599161b651cb4f8300d7e5644c8e9eb9d48b82ff1c6c6","target":"graph","created_at":"2026-05-18T00:33:32Z","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":"In this paper, we propose a framework for cross-layer optimization to ensure ultra-high reliability and ultra-low latency in radio access networks, where both transmission delay and queueing delay are considered. With short transmission time, the blocklength of channel codes is finite, and the Shannon Capacity cannot be used to characterize the maximal achievable rate with given transmission error probability. With randomly arrived packets, some packets may violate the queueing delay. Moreover, since the queueing delay is shorter than the channel coherence time in typical scenarios, the requir","authors_text":"Changyang She, Chenyang Yang, Tony Q.S. Quek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T13:52:40Z","title":"Cross-layer Optimization for Ultra-reliable and Low-latency Radio Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09575","kind":"arxiv","version":2},"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:76f9957dfc45d0b5ce266a5175c127c56bc9b6374d584ce63a70474ee882f934","target":"record","created_at":"2026-05-18T00:33:32Z","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":"dcd6a2ec0265eec0711928067750a49b8d2d69438cb2b2d69a25345bd5911473","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-28T13:52:40Z","title_canon_sha256":"1f9c9125903398f80170526419786435f9da19dd7861243e408ba47386d29073"},"schema_version":"1.0","source":{"id":"1703.09575","kind":"arxiv","version":2}},"canonical_sha256":"7c8b4416f4c08c5ebbdfa75940a05d54b29c67f1c891a46adfc0d9f1789d441a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c8b4416f4c08c5ebbdfa75940a05d54b29c67f1c891a46adfc0d9f1789d441a","first_computed_at":"2026-05-18T00:33:32.169746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:32.169746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T2LiPH/M/x2+B5e7lGvQoFYBnlJawiMdcib4wK8yaDHV1bwKdCEuj187WSOT0NPIYqEyGzVtTsFl0NNfffAwBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:32.170380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09575","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76f9957dfc45d0b5ce266a5175c127c56bc9b6374d584ce63a70474ee882f934","sha256:0199aada90555bb45ff599161b651cb4f8300d7e5644c8e9eb9d48b82ff1c6c6"],"state_sha256":"02a77440b0cf6a4141269d295c581d318321bee8e57d3a9307ed459f273cf6e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XW3YoL4vaqfRAp3UHLl8hI4PALm0Wzs2tguEt5DOSMMZlL16hipAae9+BgXFdeWz3yXnp9QtkemuwXwA9wInDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:42:50.283188Z","bundle_sha256":"d1570c894cd576b5041841c1a5fa6260264bca8cf23caae5b9d2d4c55f11417c"}}