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: "performance evaluation of the random replacement policy for networks of caches"
  Abstract: The overall performance of content distribution networks as well as recently proposed information-centric networks rely on both memory and bandwidth capacities. In this framework, the hit ratio is the key performance indicator which captures the bandwidth / memory tradeoff for a given global performance.This paper focuses on the estimation of the hit ratio in a network of caches that employ the Random replacement policy. Assuming that requests are independent and identically distributed, general expressions of miss probabilities for a single Random cache are provided as well as exact results for specific popularity distributions. Moreover, for any Zipf popularity distribution with exponent $\alpha$ > 1, we obtain asymptotic equivalents for the miss probability in the case of large cache size. We extend the analysis to networks of Random caches, when the topology is either a line or a homogeneous tree. In that case, approximations for miss probabilities across the network are derived by assuming that miss events at any node occur independently in time; the obtained results are compared to the same network using the Least-Recently-Used discipline, already addressed in the literature. We further analyze the case of a mixed tandem cache network where the two nodes employ either Random or Least-Recently-Used policies. In all scenarios, asymptotic formulas and approximations are extensively compared to simulations and shown to perform very well. Finally, our results enable us to propose recommendations for cache replacement disciplines in a network dedicated to content distribution. These results also hold for a cache using the First-In-First-Out policy.

Connected through hyperedge HE-1 (induced by source paper "generalization of lru cache replacement policy with applications to video streaming"):
  with members:
    - "fastscan robust low complexity rate adaptation algorithm for video streaming over http"
    - "lbp robust rate adaptation algorithm for svc video streaming"
    - "optimizing tcp loss recovery performance over mobile data networks"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "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-2 (induced by source paper "caching in the clouds optimized dynamic cache instantiation in content delivery systems"):
  with members:
    - "a utility optimization approach to network cache design"
    - "a versatile and accurate approximation for lru cache performance"
    - "energy aware load balancing in content delivery networks"

Connected through hyperedge HE-3 (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"
    - "exact analysis of ttl cache networks the case of caching policies driven by stopping times"
    - "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"
    - "a versatile and accurate approximation for lru cache performance"

Connected through hyperedge HE-4 (induced by source paper "on resource pooling and separation for lru caching"):
  with members:
    - "sharing lru cache resources among content providers a utility based approach"
    - "exploring the memory bandwidth tradeoff in an information centric network"
    - "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:
    - "exact analysis of ttl cache networks the case of caching policies driven by stopping times"
    - "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-6 (induced by source paper "unravelling the impact of temporal and geographical locality in content caching systems"):
  with members:
    - "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-7 (induced by source paper "efficient analysis of caching strategies under dynamic content popularity"):
  with members:
    - "unravelling the impact of temporal and geographical locality in content caching systems"
    - "a unified approach to the performance analysis of caching systems"
    - "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 "exact analysis of ttl cache networks the case of caching policies driven by stopping times"):
  with members:
    - "a unified approach to the performance analysis of caching systems"
    - "a versatile and accurate approximation for lru cache performance"

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)