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 "mean field game theoretic edge caching in ultra dense networks"):
  Abstract: This paper investigates a cellular edge caching problem under a very large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), conventional caching algorithms may crumble in effectiveness as their complexity increases with the number of SBSs. Furthermore, the performance of a UDCN is highly sensitive to the dynamics of user demand and inter-SBS interference, due to the large number of SBSs. To overcome such difficulties, we propose a distributed caching algorithm under a stochastic geometric network model, as well as a spatio-temporal user demand model that specifies the content popularity changes within long-term and short-term periods. By exploiting mean-field game (MFG) theory, the complexity of the proposed UDCN caching algorithm becomes independent of the number of SBSs. The performance of the proposed caching algorithm can easily be calculated using stochastic geometry (SG). Numerical evaluations validate that the proposed caching algorithm reduces not only the long run average cost of the network but also the replicated caching data amount respectively by 24% and 42%, compared to a baseline caching algorithm. The simulation results also show that the propose caching algorithm is robust to imperfect popularity information, while ensuring the low computational complexity.

Includes members:
  Member "ultra dense edge caching under spatio temporal demand and network dynamics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "spatially correlated content caching for device to device communications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "throughput outage analysis and evaluation of cache aided d2d networks with measured popularity distributions")
  Member "ultra dense small cell networks turning density into energy efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "fundamental storage latency tradeoff in cache aided mimo 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 "caching in wireless small cell networks a storage bandwidth tradeoff":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "wireless content caching for small cell and d2d networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a unified framework for constructing centralized coded caching schemes")
  Member "tractable resource management with uplink decoupled millimeter wave overlay in ultra dense cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wireless edge computing with latency and reliability guarantees")
  Member "mean field games for distributed caching in ultra dense small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed edge caching via reinforcement learning in fog radio access networks")

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.NI(Networking and Internet Architecture)