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: "caching gain in wireless networks with fading a multi user diversity perspective"
  Abstract: We consider the effect of caching in wireless networks where fading is the dominant channel effect. First, we propose a one-hop transmission strategy for cache-enabled wireless networks, which is based on exploiting multi-user diversity gain. Then, we derive a closed-form result for throughput scaling of the proposed scheme in large networks, which reveals the inherent trade-off between cache memory size and network throughput. Our results show that substantial throughput improvements are achievable in networks with sources equipped with large cache size. We also verify our analytical result through simulations.

Connected through hyperedge HE-1 (induced by source paper "on storage allocation in cache enabled interference channels with mixed csit"):
  with members:
    - "fundamental limits of cache aided interference management"
    - "the synergistic gains of coded caching and delayed feedback"
    - "complete interference mitigation through receiver caching in wyner s networks"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "cache aided interference channels"
    - "caching at the edge a green perspective for 5g networks"
    - "multi server coded caching"
    - "hierarchical coded caching"

Connected through hyperedge HE-2 (induced by source paper "cross layer optimization of fast video delivery in cache enabled relaying networks"):
  with members:
    - "cache enabled opportunistic cooperative mimo for video streaming in wireless systems"
    - "buffer aided relaying with adaptive link selection"
    - "mixed timescale precoding and cache control in cached mimo interference network"

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)