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 "coded caching with linear subpacketization is possible in multi antenna communications"):
  Abstract: Exponentially growing subpacketization is known to be a major issue for practical implementation of coded caching, specially in networks with multi-antenna communication setups. We provide a new coded caching scheme for such networks, which requires linear subpacketization and is applicable to any set of network parameters, as long as the multi-antenna gain $L$ is larger than or equal to the global caching gain $t$. Our scheme includes carefully designed cache placement and delivery algorithms; which are based on circular shift of two generator arrays in perpendicular directions. It also achieves the maximum possible degrees of freedom of $t+L$, during any single transmission.

Includes members:
  Member "subpacketization rate trade off in multi antenna coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "placement delivery array design through strong edge coloring of bipartite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "on the placement delivery array design for centralized coded caching scheme":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "multi antenna interference management for coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "physical layer schemes for wireless coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "multi antenna coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to code coded caching via deep reinforcement learning")
  Member "centralized coded caching schemes a hypergraph theoretical approach":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")
  Member "finite length analysis of caching aided coded multicasting":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

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)