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 "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"):
  Abstract: Fog Radio Access Network (F-RAN) architectures can leverage both cloud processing and edge caching for content delivery to the users. To this end, F-RAN utilizes caches at the edge nodes (ENs) and fronthaul links connecting a cloud processor to ENs. Assuming time-invariant content popularity, existing information-theoretic analyses of content delivery in F-RANs rely on offline caching with separate content placement and delivery phases. In contrast, this work focuses on the scenario in which the set of popular content is time-varying, hence necessitating the online replenishment of the ENs' caches along with the delivery of the requested files. The analysis is centered on the characterization of the long-term Normalized Delivery Time (NDT), which captures the temporal dependence of the coding latencies accrued across multiple time slots in the high signal-to-noise ratio regime. Online edge caching and delivery schemes based on reactive and proactive caching principles are investigated for both serial and pipelined transmission modes across fronthaul and edge segments. Analytical results demonstrate that, in the presence of a time-varying content popularity, the rate of fronthaul links sets a fundamental limit to the long-term NDT of F-RAN system. Analytical results are further verified by numerical simulation, yielding important design insights.

Includes members:
  Member "cache aided content delivery in fog ran systems with topological information and no csi":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fundamental limits of cloud and cache aided interference management with multi antenna base stations")
  Member "fog aided wireless networks for content delivery fundamental latency tradeoffs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "cooperative tx rx caching in interference channels a storage latency tradeoff study":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "content caching and delivery in wireless radio access networks")
  Member "a layered caching architecture for the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the exact rate memory tradeoff for caching with uncoded prefetching")
  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 "cloud radio access network virtualizing wireless access for dense heterogeneous systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "joint 3d maneuver and power adaptation for secure uav communication with comp reception")
  Member "cache aided interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "fundamental limits of wireless caching under mixed cacheable and uncacheable traffic")
  Member "online coded caching":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "subexponential and linear subpacketization coded caching via line graphs and projective geometry")

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)