Pith. Sign in

RECORD

Fundamental Storage-Latency Tradeoff in Cache-Aided MIMO Interference Networks

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Youlong Cao, Meixia Tao, Fan Xu, Kangqi Liu

Information Theory · Submitted 7 Sep 2016

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1609.01826 (version 3)
Pith ID7N6ZY22P, Pith's permanent record of this paper and its review
CitationFan Xu, Kangqi Liu, Meixia Tao, Youlong Cao. "Fundamental Storage-Latency Tradeoff in Cache-Aided MIMO Interference Networks." arXiv:1609.01826 (2016). https://pith.science/paper/7N6ZY22P
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,833 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.84 · human participants 0.01 · controlled comparison 0.06 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.24 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. The obtained NDT is for arbitrary M, N and any feasible cache sizes. It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. The extension to the network with arbitrary number of transmitters and receivers is also discussed.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. background 1.00 0.06 0.02 asserted 1.00
s1 Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. background 1.00 0.06 0.02 asserted 1.00
s2 This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. contribution 0.53 0.33 0.02 asserted 0.97
s3 With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. method 0.55 0.53 0.04 asserted 1.00
s4 We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. method 0.90 0.92 0.03 asserted 0.97
s5 Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. result 0.52 0.95 0.18 asserted 1.00
s6 The obtained NDT is for arbitrary M, N and any feasible cache sizes. result 0.82 0.90 0.10 asserted 1.00
s7 It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. result 0.95 0.93 0.51 asserted 1.00
s8 The extension to the network with arbitrary number of transmitters and receivers is also discussed. contribution 0.69 0.75 0.03 asserted 0.73

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

Caching is an effective technique to improve user perceived experience for content delivery in wireless networks. Wireless caching differs from traditional web caching in that it can exploit the broadcast nature of wireless medium and hence opportunistically change the network topologies. This paper studies a cache-aided MIMO interference network with 3 transmitters each equipped with M antennas and 3 receivers each with N antennas. With caching at both the transmitter and receiver sides, the network is changed to hybrid forms of MIMO broadcast channel, MIMO X channel, and MIMO multicast channels. We analyze the degrees of freedom (DoF) of these new channel models using practical interference management schemes. Based on the collective use of these DoF results, we then obtain an achievable normalized delivery time (NDT) of the network, an information-theoretic metric that evaluates the worst-case delivery time at given cache sizes. The obtained NDT is for arbitrary M, N and any feasible cache sizes. It is shown to be optimal in certain cases and within a multiplicative gap of 3 from the optimum in other cases. The extension to the network with arbitrary number of transmitters and receivers is also discussed.

Human review

How Pith checks papers → · Full audit of this paper →

How the literature uses it

4 arXiv papers cite this in 9 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 6 sentences without a confident label

Compares with it 1 paper
  • Furthermore, in comparison with [ref] and [ref] , where authors study the case of single antenna users in a $K_T ×3$ network and multi-antenna terminals in a $3 ×3$ network, respectively, our proposed scheme is a general solution to the cache-aided wireless interference networks for single antenna terminals, that is, we present a valid solution for any arbitrary number of transmitters, receivers and cache sizes.

    Interference Networks with Caches at Both Ends · Introduction · 0.98

Cites it as background 2 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.