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: "delivery latency regions in fog rans with edge caching and cloud processing"
  Abstract: A Fog Radio Access Network (F-RAN) is a cellular wireless system that enables content delivery via edge caching, i.e., storage of popular content at the edge nodes (ENs), and cloud processing. The existing information-theoretic analyses of F-RAN systems, and special cases thereof, make the assumption that all files in the content library are equally relevant, and hence all users' requests should be guaranteed the same delivery latency (i.e., transmission time). In practice, it is generally desirable to provide different latency levels as a function of the users' requests, e.g., based on the current popularity ranking of the contents. This paper studies the problem of characterizing the region of delivery latencies for all possible users' requests under a per-EN cache capacity constraint. For the case with two ENs and two users, the latency region is characterized in the high-SNR regime in terms of the Normalized Delivery Time (NDT) metric, introduced in prior work.

Connected through hyperedge HE-1 (induced by source paper "content caching and delivery in wireless radio access networks"):
  with members:
    - "mobility aware coded storage and delivery"
    - "cache aided fog radio access networks with partial connectivity"
    - "a converse bound for cache aided interference networks"
    - "treating content delivery in multi antenna coded caching as general message sets transmission a dof region perspective"
    - "fundamental limits of decentralized caching in fog rans with wireless fronthaul"
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "decentralized coded caching in wireless networks trade off between storage and latency"
    - "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"

Connected through hyperedge HE-2 (induced by source paper "cache aided content delivery in fog ran systems with topological information and no csi"):
  with members:
    - "fog aided wireless networks for content delivery fundamental latency tradeoffs"
    - "fundamental tradeoff between storage and latency in cache aided wireless interference networks"
    - "degrees of freedom of cache aided wireless interference networks"
    - "cache aided wireless networks tradeoffs between storage and latency"
    - "cache aided interference channels"
    - "topological interference management with transmitter cooperation"
    - "topological interference management through index coding"
    - "five disruptive technology directions for 5g"

Connected through hyperedge HE-3 (induced by source paper "a survey on low latency towards 5g ran core network and caching solutions"):
  with members:
    - "stochastic optimization and control framework for 5g network slicing with effective isolation"
    - "ultra reliable and low latency communications in 5g downlink physical layer aspects"
    - "human in the loop wireless communications machine learning and brain aware resource management"
    - "r fft function split at ifft fft in unified lte cran and cable access network"
    - "a survey on mobile edge networks convergence of computing caching and communications"
    - "joint user association power control and scheduling in multi cell 5g networks"
    - "fundamental limits on latency in transceiver cache aided hetnets"
    - "decentralized coded caching in wireless networks trade off between storage and latency"

Connected through hyperedge HE-4 (induced by source paper "a low complexity approach to distributed cooperative caching with geographic constraints"):
  with members:
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "a stackelberg game for incentive proactive caching mechanisms in wireless networks"
    - "cloud and cache aided wireless networks fundamental latency trade offs"
    - "a utility optimization approach to network cache design"
    - "optimal geographic caching in cellular networks"
    - "fundamental limits of cache aided wireless bc interplay of coded caching and csit feedback"
    - "cache aided interference channels"
    - "cache enabled small cell networks modeling and tradeoffs"

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)