human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "interference cancellation at receivers in cache enabled wireless networks"):
  Abstract: In this paper, we propose to exploit the limited cache packets as side information to cancel incoming interference at the receiver side. We consider a stochastic network where the random locations of base stations and users are modeled using Poisson point processes. Caching schemes to reap both the local caching gain and the interference cancellation gain for the users are developed based on two factors: the density of different user subsets and the packets cached in the corresponding subsets. The packet loss rate (PLR) is analyzed, which depends on both the cached packets and the channel state information (CSI) available at the receiver. Theoretical results reveal the tradeoff between caching resource and wireless resource. The performance for different caching schemes are analyzed and the minimum achievable PLR for the distributed caching is derived.

Includes members:
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "degrees of freedom of cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental limits of cache aided interference management":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "a layered caching architecture for the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  Member "cache aided wireless networks tradeoffs between storage and latency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "living on the edge the role of proactive caching in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  Member "mixed timescale precoding and cache control in cached mimo interference network":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "joint downlink scheduling for file placement and delivery in cache assisted wireless networks with finite file lifetime")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)