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 "resolving a feedback bottleneck of multi antenna coded caching"):
  Abstract: The work here makes substantial progress towards resolving the well known feedback bottleneck of multi-antenna coded caching, by introducing a fundamentally new algorithm that completely untangles caching gains from feedback costs. In the context of the $K$-user MISO broadcast channel with cache-aided receivers and an $L$-antenna transmitter, the algorithm achieves full multiplexing gains and unbounded near-optimal caching gains at the mere CSIT/CSIR costs associated to achieving multiplexing gains only. While prior state-of-art required feedback costs that scaled with $K$, the new algorithm requires only $L$ uplink/downlink feedback acquisition slots, irrespective of how large the achieved caching gain is, and thus irrespective of how many users are served at a time. In the end, the result solidifies the role of coded caching as a method for reducing feedback requirements in multi-antenna environments.

Includes members:
  Member "the exact rate memory tradeoff for caching with uncoded prefetching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "full coded caching gains for cache less users":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels")
  Member "on multi server coded caching in the low memory regime":
    also connected through other hyperedges:
      (none)
  Member "alpha fair coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coded caching with uneven channels a quality of experience approach")
  Member "generalized degrees of freedom of the symmetric cache aided miso broadcast channel with partial csit":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "multi antenna interference management for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "scalable content delivery with coded caching in multi antenna fading 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 "on coded caching in the overloaded miso broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)