{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KWWSV2KWBEEFSNHMNDRGTLP4OK","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":"991c7eb5596fdd8c9cfb6de655b11477687ea7d4be430509a48f2ffb9623e0ab","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T15:21:50Z","title_canon_sha256":"ce0d6b0693f6760b86b8f7e47ef81a0b28422857916bc038101851baa179b24f"},"schema_version":"1.0","source":{"id":"1501.06440","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.06440","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"1501.06440v2","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06440","created_at":"2026-05-18T02:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"KWWSV2KWBEEF","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"KWWSV2KWBEEFSNHM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"KWWSV2KW","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:37b5c0b82f70378c6391e8b0923ba8a601ac7d5d51c43084f83038e4cff3c149","target":"graph","created_at":"2026-05-18T02:18:03Z","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":"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","authors_text":"Dennis Hui, Giuseppe Caire, Ivana Maric, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T15:21:50Z","title":"On the Achievable Rates of Multihop Virtual Full-Duplex Relay Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06440","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:e477e8dbe20e398477e0b162c47a3f3261ae34670fe02dfdd9e6e29d823fe071","target":"record","created_at":"2026-05-18T02:18:03Z","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":"991c7eb5596fdd8c9cfb6de655b11477687ea7d4be430509a48f2ffb9623e0ab","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-26T15:21:50Z","title_canon_sha256":"ce0d6b0693f6760b86b8f7e47ef81a0b28422857916bc038101851baa179b24f"},"schema_version":"1.0","source":{"id":"1501.06440","kind":"arxiv","version":2}},"canonical_sha256":"55ad2ae95609085934ec68e269adfc729a31f8120c1a6b95c73c614ba58a365a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55ad2ae95609085934ec68e269adfc729a31f8120c1a6b95c73c614ba58a365a","first_computed_at":"2026-05-18T02:18:03.513526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:03.513526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nSLH/EFFbJTrCtcrTnBzxgLNF4pVFf3IJjI/U9hlAXjmuPoFr8z5sp3F+8PcTtlUAZXiAQa9BMineCj14BMcCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:03.514161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.06440","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e477e8dbe20e398477e0b162c47a3f3261ae34670fe02dfdd9e6e29d823fe071","sha256:37b5c0b82f70378c6391e8b0923ba8a601ac7d5d51c43084f83038e4cff3c149"],"state_sha256":"9c9eef08d344e40945b42d54df9f89062f3f90b6e16e30b9ace65ef6427ab74a"}