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 "the design of dynamic probabilistic caching with time varying content popularity"):
  Abstract: In this paper, we design dynamic probabilistic caching for the scenario when the instantaneous content popularity may vary with time while it is possible to predict the average content popularity over a time window. Based on the average content popularity, optimal content caching probabilities can be found, e.g., from solving optimization problems, and existing results in the literature can implement the optimal caching probabilities via static content placement. The objective of this work is to design dynamic probabilistic caching that: i) converge (in distribution) to the optimal content caching probabilities under time-invariant content popularity, and ii) adapt to the time-varying instantaneous content popularity under time-varying content popularity. Achieving the above objective requires a novel design of dynamic content replacement because static caching cannot adapt to varying content popularity while classic dynamic replacement policies, such as LRU, cannot converge to target caching probabilities (as they do not exploit any content popularity information). We model the design of dynamic probabilistic replacement policy as the problem of finding the state transition probability matrix of a Markov chain and propose a method to generate and refine the transition probability matrix. Extensive numerical results are provided to validate the effectiveness of the proposed design.

Includes members:
  Member "decentralized caching for content delivery based on blockchain a game theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on consensus mechanisms and mining strategy management in blockchain networks")
  Member "cost effective cache deployment in mobile heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  Member "caching policy toward maximal success probability and area spectral efficiency of cache enabled hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modeling analysis and optimization of caching in multi antenna small cell networks")
  Member "a survey on low latency towards 5g ran core network and caching solutions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "allocation of computation intensive graph jobs over vehicular clouds in iov")
  Member "wireless device to device caching networks basic principles and system performance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "joint optimization of file placement and delivery in cache assisted wireless networks with limited lifetime and cache space")
  Member "optimization and analysis of probabilistic caching in n tier heterogeneous networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing physical layer security of random caching in large scale multi antenna heterogeneous wireless networks")
  Member "cache enabled heterogeneous cellular networks optimal tier level content placement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "optimal geographic caching in cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "online convex optimization for caching 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)