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 "a rolling horizon dynamic programming approach for collaborative caching"):
  Abstract: In this paper, we study the online collaborative content caching problem from network economics point of view. The network consists of small cell base stations (SCBSs) with limited cache capacity and a macrocell base station (MCBS). SCBSs are connected with their neighboring SCBSs through high-speed links and collaboratively decide what data to cache. Contents are placed at the SCBSs "free of charge" at off-peak hours and updated during the day according to the content demands by considering the network usage cost. We first model the caching optimization as a finite horizon Markov Decision Process that incorporates an auto-regressive model to forecast the evolution of the content demands. The problem is NP-hard and the optimal solution can be found only for a small number of base stations and contents. To allow derivation of close to optimal solutions for larger networks, we propose the rolling horizon method, which approximates future network usage cost by considering a small decision horizon. The results show that the rolling horizon approach outperforms comparison schemes significantly. Finally, we examine two simplifications of the problem to accelerate the speed of the solution: (a) we restrict the number of content replicas in the network and (b) we limit the allowed content replacements. The results show that the rolling horizon scheme can reduce the communication cost by over 84% compared to that of running Least Recently Used (LRU) updates on offline schemes. The results also shed light on the tradeoff between the efficiency of the caching policy and the time needed to run the online algorithm.

Includes members:
  Member "popnetcod a popularity based caching policy for network coding enabled named data networking":
    also connected through other hyperedges:
      (none)
  Member "content popularity prediction towards location aware mobile edge caching":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  Member "using grouped linear prediction and accelerated reinforcement learning for online content caching":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "reinforcement learning based cooperative coded caching under dynamic popularities in ultra dense networks")
  Member "optimal and scalable caching for 5g using reinforcement learning of space time popularities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "online convex optimization for caching networks")
  Member "caching with time varying popularity profiles a learning theoretic perspective":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal scheduling of content caching subject to deadline")
  Member "context aware proactive content caching with service differentiation in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing")
  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 "joint caching routing and channel assignment for collaborative small cell cellular networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "consistent user traffic allocation and load balancing in mobile edge caching")

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)