human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "cache aided content delivery in fog ran systems with topological information and no csi"):
  Abstract: In this work, we consider a Fog Radio Access Network (F-RAN) system with a partially connected wireless topology and no channel state information available at the cloud and Edge Nodes (ENs). An F-RAN consists of ENs that are equipped with caches and connected to the cloud through fronthaul links. We first focus on the case where cloud connectivity is disabled, and hence the ENs have to satisfy the user demands based only on their cache contents. For a class of partially connected regular networks, we present a delivery scheme which combines intra-file MDS coded caching at the ENs and blind interference avoidance on the wireless edge channel. This scheme requires minimum storage and leads to an achievable Normalized Delivery Time (NDT) that is within a constant multiplicative factor of the best known NDT with full storage. We next provide achievable schemes for the case where cloud connectivity is enabled, and we provide new insights on the interplay between cloud connectivity and edge caching when only topological information is available.

Includes members:
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "fundamental tradeoff between storage and latency in cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "delivery latency regions in fog rans with edge caching and cloud processing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "degrees of freedom of cache aided wireless interference networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cache aided wireless networks tradeoffs between storage and latency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "topological interference management with transmitter cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")
  Member "topological interference management through index coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the separability of parallel miso broadcast channels under partial csit a degrees of freedom region perspective")

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