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 "cache aided interference management in partially connected wireless networks"):
  Abstract: Cache-aided communication is emerging as a new topic in wireless networks. Previous works have shown that caching in interference networks can change the interference topology by changing the information flow and hence facilitate advanced interference management. This paper studies the gain of caching in partially connected interference networks where each receiver can only communicate with a subset of transmitters. The performance is characterized by an information-theoretic metric, normalized delivery time (NDT). We obtain an order-optimal NDT for the (K+L-1) x K partially connected linear interference network with any number of receivers K, any receiver connectivity L <= K, and with caches equipped at all transmitters and receivers. The cache placement phase adopts a file splitting strategy tailor-made for the partial receiver connectivity. Via the aid of virtual receivers, the proposed delivery strategy exploits coded multicasting gain by XOR combining and transmitter coordination gain by interference alignment. In the special case when L is a divisor of K, our NDT results are directly applicable to K x K partially connected circular interference networks.

Includes members:
  Member "cache aided fog radio access networks with partial connectivity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "degrees of freedom of cache aided wireless cellular networks")
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "coded caching in a multi server system with random topology":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "routing based delivery in combination type networks with random topology")
  Member "fundamental limits on delivery time in cloud and cache aided heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "centralized and decentralized cache aided interference management in heterogeneous parallel channels")
  Member "decentralized coded caching in wireless networks trade off 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 "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental storage latency tradeoff in cache aided mimo interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")

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)