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: "exact analysis of ttl cache networks the case of caching policies driven by stopping times"
  Abstract: TTL caching models have recently regained significant research interest, largely due to their ability to fit popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times. The obtained results are further generalized, using the second method, to feedforward networks with Markov arrival processes (MAP) requests. MAPs are particularly suitable for non-line networks because they are closed not only under superposition and splitting, as known, but also under input-output caching operations as proven herein for phase-type TTL distributions. The crucial benefit of the two closure properties is that they jointly enable the first exact analysis of feedforward networks of TTL caches in great generality.

Connected through hyperedge HE-1 (induced by source paper "practical bounds on optimal caching with variable object sizes"):
  with members:
    - "adaptive caching networks with optimality guarantees"
    - "general caching is hard even with small pages"
    - "tinylfu a highly efficient cache admission policy"
    - "a nearly linear time ptas for explicit fractional packing and covering linear programs"
    - "a combinatorial tilde o m 3 2 time algorithm for the min cost flow problem"
    - "a unified approach to the performance analysis of caching systems"
    - "performance evaluation of the random replacement policy for networks of caches"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-2 (induced by source paper "jointly optimal routing and caching for arbitrary network topologies"):
  with members:
    - "a utility optimization approach to network cache design"
    - "adaptive caching networks with optimality guarantees"
    - "optimal geographic caching in cellular networks"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "a unified approach to the performance analysis of caching systems"
    - "vip a framework for joint dynamic forwarding and caching in named data networks"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-3 (induced by source paper "on the convergence of the ttl approximation for an lru cache under independent stationary request processes"):
  with members:
    - "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 "stationary distribution of a generalized lru mru content cache"):
  with members:
    - "a unified approach to the performance analysis of caching systems"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-5 (induced by source paper "adaptive caching networks with optimality guarantees"):
  with members:
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "a unified approach to the performance analysis of caching systems"
    - "vip a framework for joint dynamic forwarding and caching in named data networks"
    - "performance evaluation of the random replacement policy for networks of caches"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-6 (induced by source paper "optimal storage aware caching policies for content centric clouds"):
  with members:
    - "efficient proactive caching for supporting seamless mobility"

Connected through hyperedge HE-7 (induced by source paper "an inverse problem approach for content popularity estimation"):
  with members:
    - "catalog dynamics impact of content publishing and perishing on the performance of a lru cache"
    - "exploring the memory bandwidth tradeoff in an information centric network"
    - "impact of traffic mix on caching performance in a content centric network"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-8 (induced by source paper "flexible content placement in cache networks using reinforced counters"):
  with members:
    - "enabling information centric networks through opportunistic search routing and caching"
    - "a general tractable and accurate model for a cascade of caches"

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)