{"paper":{"title":"Cache-Aided Interference Management with Subexponential Subpacketization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Hari Hara Suthan Chittoor, K V Sushena Sree, Prasad Krishnan","submitted_at":"2019-04-10T14:31:01Z","abstract_excerpt":"Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\\mathsf{DoF}$ for this channel is the maximum number of receivers which can be served simultaneously with vanishing probability of error as the $\\mathsf{SNR}$ grows large, under a class of schemes known as \\textit{one-shot} schemes. Consider that there exists transmitter and receiver side caches which can store fractions $\\frac{M_T}{N}$ and $\\frac{M_R}{N}$ of the library respectively. Recent work for this cache-aided in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05213","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"}