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: "subpacketization rate trade off in multi antenna coded caching"
  Abstract: Coded caching can be applied in wireless multi-antenna communications by multicast beamforming coded data chunks to carefully selected user groups and using the existing file fragments in user caches to decode the desired files at each user. However, the number of packets a file should be split into, known as subpacketization, grows exponentially with the network size. We provide a new scheme, which enables the level of subpacketization to be selected freely among a set of predefined values depending on basic network parameters such as antenna and user count. A simple efficiency index is also proposed as a performance indicator at various subpacketization levels. The numerical examples demonstrate that larger subpacketization generally results in better efficiency index and higher symmetric rate, while smaller subpacketization incurs significant loss in the achievable rate. This enables more efficient caching schemes, tailored to the available computational and power resources.

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"
    - "a multi antenna coded caching scheme with linear subpacketization"
    - "decentralized coded caching without file splitting"
    - "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:
    - "a multi antenna coded caching scheme with linear subpacketization"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels"):
  with members:
    - "low subpacketization coded caching via projective geometry for broadcast and d2d networks"
    - "a new design framework on device to device coded caching with optimal rate and significantly less subpacketizations"
    - "a low complexity cache aided multi antenna content delivery scheme"
    - "full coded caching gains for cache less users"
    - "coded caching for heterogeneous systems an optimization perspective"
    - "centralized caching with unequal cache sizes"
    - "cache aided communications with multiple antennas at finite snr"
    - "alpha fair coded caching"

Connected through hyperedge HE-4 (induced by source paper "a multi antenna coded caching scheme with linear subpacketization"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "multi antenna interference management for coded caching"
    - "physical layer schemes for wireless coded caching"
    - "multi antenna coded caching"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "finite length analysis of caching aided coded multicasting"
    - "multi server coded caching"

Connected through hyperedge HE-5 (induced by source paper "coded caching with linear subpacketization is possible in multi antenna communications"):
  with members:
    - "placement delivery array design through strong edge coloring of bipartite graphs"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "multi antenna interference management for coded caching"
    - "physical layer schemes for wireless coded caching"
    - "multi antenna coded caching"
    - "centralized coded caching schemes a hypergraph theoretical approach"
    - "finite length analysis of caching aided coded multicasting"
    - "multi server coded caching"

Connected through hyperedge HE-6 (induced by source paper "subpacketization beamformer interaction in multi antenna coded caching"):
  with members:
    - "coded caching with linear subpacketization is possible in multi antenna communications"
    - "multi antenna interference management for coded caching"
    - "physical layer schemes for wireless coded caching"
    - "multi server coded caching"
    - "hierarchical coded caching"
    - "online 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)