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: "efficient analysis of caching strategies under dynamic content popularity"
  Abstract: In this paper we develop a novel technique to analyze both isolated and interconnected caches operating under different caching strategies and realistic traffic conditions. The main strength of our approach is the ability to consider dynamic contents which are constantly added into the system catalogue, and whose popularity evolves over time according to desired profiles. We do so while preserving the simplicity and computational efficiency of models developed under stationary popularity conditions, which are needed to analyze several caching strategies. Our main achievement is to show that the impact of content popularity dynamics on cache performance can be effectively captured into an analytical model based on a fixed content catalogue (i.e., a catalogue whose size and objects' popularity do not change over time).

Connected through hyperedge HE-1 (induced by source paper "aoi delay tradeoff in mobile edge caching with freshness aware content refreshing"):
  with members:
    - "cooperative service caching and workload scheduling in mobile edge computing"
    - "ai assisted low information latency wireless networking"
    - "age of information aware radio resource management in vehicular networks a proactive deep reinforcement learning perspective"
    - "minimum age of information in the internet of things with non uniform status packet sizes"
    - "content popularity prediction towards location aware mobile edge caching"
    - "air ground integrated vehicular network slicing with content pushing and caching"
    - "cost effective cache deployment in mobile heterogeneous networks"
    - "edge caching wireless networks performance analysis and optimization"

Connected through hyperedge HE-2 (induced by source paper "the study of dynamic caching via state transition field the case of time invariant popularity"):
  with members:
    - "content popularity prediction towards location aware mobile edge caching"
    - "using grouped linear prediction and accelerated reinforcement learning for online content caching"
    - "optimal and scalable caching for 5g using reinforcement learning of space time popularities"
    - "caching with time varying popularity profiles a learning theoretic perspective"
    - "enabling edge cooperation in tactile internet via 3c resource sharing"
    - "air ground integrated vehicular network slicing with content pushing and caching"
    - "a reinforcement learning approach to proactive caching in wireless networks"
    - "online edge caching and wireless delivery in fog aided networks with dynamic content popularity"

Connected through hyperedge HE-3 (induced by source paper "a swiss army knife for dynamic caching in small cell networks"):
  with members:
    - "similarity caching theory and algorithms"
    - "learning to cache with no regrets"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "cooperative caching and transmission design in cluster centric small cell networks"
    - "placing dynamic content in caches with small population"
    - "optimal geographic caching in cellular networks"
    - "a unified approach to the performance analysis of caching systems"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-4 (induced by source paper "implicit coordination of caches in small cell networks under unknown popularity profiles"):
  with members:
    - "a low complexity approach to distributed cooperative caching with geographic constraints"
    - "spatial multi lru distributed caching for wireless networks with coverage overlaps"
    - "spatial multi lru caching for wireless networks with coverage overlaps"
    - "placing dynamic content in caches with small population"
    - "optimal geographic caching in cellular networks"
    - "a versatile and accurate approximation for lru cache performance"
    - "femtocaching wireless video content delivery through distributed caching helpers"

Connected through hyperedge HE-5 (induced by source paper "pangea monolithic distributed storage for data analytics"):
  with members:
    - "plinycompute a platform for high performance distributed data intensive tool development"
    - "lifetime based memory management for distributed data processing systems"
    - "tensorflow large scale machine learning on heterogeneous distributed systems"
    - "xoring elephants novel erasure codes for big data"
    - "interactive analytical processing in big data systems a cross industry study of mapreduce workloads"
    - "the k server dual and loose competitiveness for paging"

Connected through hyperedge HE-6 (induced by source paper "understanding performance of edge content caching for mobile video streaming"):
  with members:
    - "placing dynamic content in caches with small population"
    - "content caching and delivery over heterogeneous wireless networks"
    - "forecasting popularity of videos using social media"
    - "understanding mobile traffic patterns of large scale cellular towers in urban environment"
    - "fake view analytics in online video services"
    - "exploring the memory bandwidth tradeoff in an information centric network"
    - "asymptotic laws for joint content replication and delivery in wireless networks"
    - "fundamental limits of caching"

Connected through hyperedge HE-7 (induced by source paper "stochastic dynamic cache partitioning for encrypted content delivery"):
  with members:
    - "projection onto the probability simplex an efficient algorithm with a simple proof and an application"
    - "impact of traffic mix on caching performance in a content centric 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.PF(Performance)