{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7J2HG2R4AWQJAUX6FAPDZIQRTL","short_pith_number":"pith:7J2HG2R4","schema_version":"1.0","canonical_sha256":"fa74736a3c05a09052fe281e3ca2119acaca19a122a1839e16949b8e92974cd3","source":{"kind":"arxiv","id":"1803.02243","version":1},"attestation_state":"computed","paper":{"title":"Achieving Low Latency Two-Way Communication by Downlink and Uplink Decoupled Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Min Kim, Nuno K. Pratas, Petar Popovski","submitted_at":"2018-03-06T15:14:40Z","abstract_excerpt":"In many scenarios, low latency wireless communication assumes two-way connection, such that the node that receives information can swiftly send acknowledgment or other response. In this paper, we address the problem of low latency two-way communication and address it through proposal of a base station (BS) cooperation scheme. The scheme is based on downlink (DL) and uplink (UL) decoupled access (DUDA). To the best of our knowledge, this is the first time that the idea of decoupled access is used to reduce latency. We derive the analytical expression for the average latency and verify that the "},"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":"1803.02243","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-06T15:14:40Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"9ff5c612d64bf97ff131cc75d001ea1c340ace102ad2c94b10877209cbcae773","abstract_canon_sha256":"84cfb2812c7e2ea14a54c8cf1fb63a6b338303e7c99e73f55f70dfa9a41451af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:55.435858Z","signature_b64":"VSq7zHjxL8+1KucpdoF1CUcFYUVUkrLmf175tYKU6JryxyTQgjXU3e19wX6doEWEu5nxrG/ezDRAx2Lt+dzJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa74736a3c05a09052fe281e3ca2119acaca19a122a1839e16949b8e92974cd3","last_reissued_at":"2026-05-18T00:21:55.435199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:55.435199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Achieving Low Latency Two-Way Communication by Downlink and Uplink Decoupled Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Min Kim, Nuno K. Pratas, Petar Popovski","submitted_at":"2018-03-06T15:14:40Z","abstract_excerpt":"In many scenarios, low latency wireless communication assumes two-way connection, such that the node that receives information can swiftly send acknowledgment or other response. In this paper, we address the problem of low latency two-way communication and address it through proposal of a base station (BS) cooperation scheme. The scheme is based on downlink (DL) and uplink (UL) decoupled access (DUDA). To the best of our knowledge, this is the first time that the idea of decoupled access is used to reduce latency. We derive the analytical expression for the average latency and verify that the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.02243","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":"1803.02243","created_at":"2026-05-18T00:21:55.435309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.02243v1","created_at":"2026-05-18T00:21:55.435309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.02243","created_at":"2026-05-18T00:21:55.435309+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J2HG2R4AWQJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J2HG2R4AWQJAUX6","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J2HG2R4","created_at":"2026-05-18T12:32:11.075285+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/7J2HG2R4AWQJAUX6FAPDZIQRTL","json":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL.json","graph_json":"https://pith.science/api/pith-number/7J2HG2R4AWQJAUX6FAPDZIQRTL/graph.json","events_json":"https://pith.science/api/pith-number/7J2HG2R4AWQJAUX6FAPDZIQRTL/events.json","paper":"https://pith.science/paper/7J2HG2R4"},"agent_actions":{"view_html":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL","download_json":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL.json","view_paper":"https://pith.science/paper/7J2HG2R4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.02243&json=true","fetch_graph":"https://pith.science/api/pith-number/7J2HG2R4AWQJAUX6FAPDZIQRTL/graph.json","fetch_events":"https://pith.science/api/pith-number/7J2HG2R4AWQJAUX6FAPDZIQRTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL/action/storage_attestation","attest_author":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL/action/author_attestation","sign_citation":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL/action/citation_signature","submit_replication":"https://pith.science/pith/7J2HG2R4AWQJAUX6FAPDZIQRTL/action/replication_record"}},"created_at":"2026-05-18T00:21:55.435309+00:00","updated_at":"2026-05-18T00:21:55.435309+00:00"}