human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a multi antenna coded caching scheme with linear subpacketization"
  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 transmission interval.

Connected through hyperedge HE-1 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry"):
  with members:
    - "some new constructions of coded caching schemes with reduced subpacketization"
    - "decentralized coded caching without file splitting"
    - "subpacketization rate trade off in multi antenna coded caching"
    - "coded caching based on combinatorial designs"
    - "a unified framework for constructing centralized coded caching schemes"
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "coded caching via projective geometry a new low subpacketization scheme"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"

Connected through hyperedge HE-2 (induced by source paper "coded caching with uneven channels a quality of experience approach"):
  with members:
    - "subpacketization rate trade off in multi antenna coded caching"
    - "subpacketization beamformer interaction in multi antenna coded caching"
    - "fundamental limits of wireless caching under uneven capacity channels"
    - "alpha fair coded caching"
    - "multi antenna interference management for coded caching"
    - "physical layer schemes for wireless coded caching"
    - "multi server coded caching"
    - "fundamental limits of caching"

Question: Please tell me which class the center node 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)