{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KWWSV2KWBEEFSNHMNDRGTLP4OK","short_pith_number":"pith:KWWSV2KW","schema_version":"1.0","canonical_sha256":"55ad2ae95609085934ec68e269adfc729a31f8120c1a6b95c73c614ba58a365a","source":{"kind":"arxiv","id":"1501.06440","version":2},"attestation_state":"computed","paper":{"title":"On the Achievable Rates of Multihop Virtual Full-Duplex Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Hui, Giuseppe Caire, Ivana Maric, Song-Nam Hong","submitted_at":"2015-01-26T15:21:50Z","abstract_excerpt":"We study a multihop \"virtual\" full-duplex relay channel as a special case of a general multiple multicast relay network. For such channel, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the cut-set upper bound within a constant gap where the gap grows {\\em linearly} with the number of relay stages $K$. However, this gap may not be negligible for the systems with multihop transmissions (i.e., a wireless backhaul operating at higher frequencies). We have recently attained an improved result to the capacity scaling where the gap grows {\\em logarithmically} as $\\log{K}$, b"},"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":"1501.06440","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T15:21:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ce0d6b0693f6760b86b8f7e47ef81a0b28422857916bc038101851baa179b24f","abstract_canon_sha256":"991c7eb5596fdd8c9cfb6de655b11477687ea7d4be430509a48f2ffb9623e0ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:03.514161Z","signature_b64":"nSLH/EFFbJTrCtcrTnBzxgLNF4pVFf3IJjI/U9hlAXjmuPoFr8z5sp3F+8PcTtlUAZXiAQa9BMineCj14BMcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55ad2ae95609085934ec68e269adfc729a31f8120c1a6b95c73c614ba58a365a","last_reissued_at":"2026-05-18T02:18:03.513526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:03.513526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Achievable Rates of Multihop Virtual Full-Duplex Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dennis Hui, Giuseppe Caire, Ivana Maric, Song-Nam Hong","submitted_at":"2015-01-26T15:21:50Z","abstract_excerpt":"We study a multihop \"virtual\" full-duplex relay channel as a special case of a general multiple multicast relay network. For such channel, quantize-map-and-forward (QMF) (or noisy network coding (NNC)) achieves the cut-set upper bound within a constant gap where the gap grows {\\em linearly} with the number of relay stages $K$. However, this gap may not be negligible for the systems with multihop transmissions (i.e., a wireless backhaul operating at higher frequencies). We have recently attained an improved result to the capacity scaling where the gap grows {\\em logarithmically} as $\\log{K}$, b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06440","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.06440","created_at":"2026-05-18T02:18:03.513634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06440v2","created_at":"2026-05-18T02:18:03.513634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06440","created_at":"2026-05-18T02:18:03.513634+00:00"},{"alias_kind":"pith_short_12","alias_value":"KWWSV2KWBEEF","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KWWSV2KWBEEFSNHM","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KWWSV2KW","created_at":"2026-05-18T12:29:29.992203+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/KWWSV2KWBEEFSNHMNDRGTLP4OK","json":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK.json","graph_json":"https://pith.science/api/pith-number/KWWSV2KWBEEFSNHMNDRGTLP4OK/graph.json","events_json":"https://pith.science/api/pith-number/KWWSV2KWBEEFSNHMNDRGTLP4OK/events.json","paper":"https://pith.science/paper/KWWSV2KW"},"agent_actions":{"view_html":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK","download_json":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK.json","view_paper":"https://pith.science/paper/KWWSV2KW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06440&json=true","fetch_graph":"https://pith.science/api/pith-number/KWWSV2KWBEEFSNHMNDRGTLP4OK/graph.json","fetch_events":"https://pith.science/api/pith-number/KWWSV2KWBEEFSNHMNDRGTLP4OK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK/action/storage_attestation","attest_author":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK/action/author_attestation","sign_citation":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK/action/citation_signature","submit_replication":"https://pith.science/pith/KWWSV2KWBEEFSNHMNDRGTLP4OK/action/replication_record"}},"created_at":"2026-05-18T02:18:03.513634+00:00","updated_at":"2026-05-18T02:18:03.513634+00:00"}