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 "traffic minimizing caching and latent variable distributions of order statistics"):
  Abstract: Given a statistical model for the request frequencies and sizes of data objects in a caching system, we derive the probability density of the size of the file that accounts for the largest amount of data traffic. This is equivalent to finding the required size of the cache for a caching placement that maximizes the expected byte hit ratio for given file size and popularity distributions. The file that maximizes the expected byte hit ratio is the file for which the product of its size and popularity is the highest -- thus, it is the file that incurs the greatest load on the network. We generalize this theoretical problem to cover factors and addends of arbitrary order statistics for given parent distributions. Further, we study the asymptotic behavior of these distributions. We give several factor and addend densities of widely-used distributions, and verify our results by extensive computer simulations.

Includes members:
  Member "how much cache is needed to achieve linear capacity scaling in backhaul limited dense wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "edge caching in dense heterogeneous cellular networks with massive mimo aided self backhaul")
  Member "a learning based approach to caching in heterogenous small cell networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "online convex optimization for caching networks")
  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 "unravelling the impact of temporal and geographical locality in content caching systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the study of dynamic caching via state transition field the case of time invariant popularity")
  Member "adapting caching to audience retention rate which video chunk to store":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to cache with no regrets")
  Member "catalog dynamics impact of content publishing and perishing on the performance of a lru cache":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "online convex optimization for caching networks")
  Member "living on the edge the role of proactive caching in 5g wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")

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)