human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "analyzing the performance of lru caches under non stationary traffic patterns"
  Abstract: This work presents, to the best of our knowledge of the literature, the first analytic model to address the performance of an LRU (Least Recently Used) implementing cache under non-stationary traffic conditions, i.e., when the popularity of content evolves with time. We validate the accuracy of the model using Monte Carlo simulations. We show that the model is capable of accurately estimating the cache hit probability, when the popularity of content is non-stationary. #R##N#We find that there exists a dependency between the performance of an LRU implementing cache and i) the lifetime of content in a system, ii) the volume of requests associated with it, iii) the distribution of content request volumes and iv) the shape of the popularity profile over time.

Connected through hyperedge HE-1 (induced by source paper "multi agent learning for cooperative large scale caching networks"):
  with members:
    - "a low complexity approach to distributed cooperative caching with geographic constraints"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "content caching and delivery over heterogeneous wireless networks"
    - "learning based optimization of cache content in a small cell base station"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "a deep reinforcement learning based framework for content caching"):
  with members:
    - "the reactor a fast and sample efficient actor critic agent for reinforcement learning"
    - "placing dynamic content in caches with small population"
    - "deep reinforcement learning in large discrete action spaces"
    - "continuous control with deep reinforcement learning"
    - "learning based optimization of cache content in a small cell base station"

Connected through hyperedge HE-3 (induced by source paper "catalog dynamics impact of content publishing and perishing on the performance of a lru cache"):
  with members:
    - "a unified approach to the performance analysis of caching systems"
    - "a versatile and accurate approximation for lru cache performance"
    - "understanding the characteristics of internet short video sharing youtube as a case study"

Connected through hyperedge HE-4 (induced by source paper "temporal analysis of activity patterns of editors in collaborative mapping project of openstreetmap"):
  with members:
    - "on the bursty evolution of online social networks"
    - "a practical approach to language complexity a wikipedia case study"
    - "rhythms of social interaction messaging within a massive online network"

Question: Please tell me which class the center node 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)