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: "cache aided communications with multiple antennas at finite snr"
  Abstract: We study the problem of cache-aided communication for cellular networks with multi-user and multiple antennas at finite signal-to-noise ratio. Users are assumed to have non-symmetric links, modeled by wideband fading channels. We show that the problem can be formulated as a linear program, whose solution provides a joint cache allocation along with pre-fetching and fetching schemes that minimize the duration of the communication in the delivery phase. The suggested scheme uses zero-forcing and cached interference subtraction and hence allow each user to be served at the rate of its own channel. Thus, this scheme is better than the previously published schemes that are compromised by the poorest user in the communication group. We also consider a special case of the parameters for which we can derive a closed form solution and formulate the optimal power, rate and cache optimization. This special case shows that the gain of MIMO coded caching goes beyond the throughput. In particular, it is shown that in this case, the cache is used to balance the users such that fairness and throughput are no longer contradicting. More specifically, in this case, strict fairness is achieved jointly with maximizing the network throughput.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic"):
  with members:
    - "fundamental limits of wireless caching under uneven capacity channels"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the capacity region of a cache aided gaussian broadcast channel with multi layer messages"
    - "adding transmitters dramatically boosts coded caching gains for finite file sizes"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "centralized and decentralized cache aided interference management in heterogeneous parallel channels"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "benefits of cache assignment on degraded broadcast channels"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under uneven capacity channels"):
  with members:
    - "subpacketization rate trade off in multi antenna coded caching"
    - "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"
    - "alpha fair coded 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)