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 "ultra dense edge caching under spatio temporal demand and network dynamics"):
  Abstract: This paper investigates a cellular edge caching design under an extremely large number of small base stations (SBSs) and users. In this ultra-dense edge caching network (UDCN), SBS-user distances shrink, and each user can request a cached content from multiple SBSs. Unfortunately, the complexity of existing caching controls' mechanisms increases with the number of SBSs, making them inapplicable for solving the fundamental caching problem: How to maximize local caching gain while minimizing the replicated content caching? Furthermore, spatial dynamics of interference is no longer negligible in UDCNs due to the surge in interference. In addition, the caching control should consider temporal dynamics of user demands. To overcome such difficulties, we propose a novel caching algorithm weaving together notions of mean-field game theory and stochastic geometry. These enable our caching algorithm to become independent of the number of SBSs and users, while incorporating spatial interference dynamics as well as temporal dynamics of content popularity and storage constraints. Numerical evaluation validates the fact that the proposed algorithm reduces not only the long run average cost by at least 24% but also the number of replicated content by 56% compared to a popularity-based algorithm.

Includes members:
  Member "ultra dense small cell networks turning density into energy efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (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-4 (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-5 (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-6 (induced by source paper "distributed edge caching via reinforcement learning in fog radio access networks")
  Member "user centric mobility management in ultra dense cellular networks under spatio temporal dynamics":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "spatio temporal modeling for massive and sporadic access")
  Member "optimizing mds codes for caching at the edge":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell 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)