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: "network cache design under stationary requests exact analysis and poisson approximation"
  Abstract: The design of caching algorithms to maximize hit probability has been extensively studied. In this paper, we associate each content with a utility, which is a function of either the corresponding content hit rate or hit probability. We formulate a cache optimization problem to maximize the sum of utilities over all contents under stationary and ergodic request processes. This problem is non-convex in general but we reformulate it as a convex optimization problem when the inter-request time (irt) distribution has a non-increasing hazard rate function. We provide explicit optimal solutions for some irt distributions, and compare the solutions of the hit-rate based (HRB) and hit-probability based (HPB) problems. We formulate a reverse engineering based dual implementation of LRU under stationary arrivals. We also propose decentralized algorithms that can be implemented using limited information and use a discrete time Lyapunov technique (DTLT) to correctly characterize their stability. We find that decentralized algorithms that solve HRB are more robust than decentralized HPB algorithms. Informed by these results, we further propose lightweight Poisson approximate decentralized and online algorithms that are accurate and efficient in achieving optimal hit rates and hit probabilities.

Connected through hyperedge HE-1 (induced by source paper "joint data compression and caching approaching optimality with guarantees"):
  with members:
    - "jointly optimal routing and caching for arbitrary network topologies"
    - "what when and where to cache a unified optimization approach"
    - "accurate learning or fast mixing dynamic adaptability of caching algorithms"
    - "adaptive caching networks with optimality guarantees"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"

Connected through hyperedge HE-2 (induced by source paper "what when and where to cache a unified optimization approach"):
  with members:
    - "lru cache under stationary requests"
    - "jointly optimal routing and caching for arbitrary network topologies"
    - "accurate learning or fast mixing dynamic adaptability of caching algorithms"
    - "a utility optimization approach to network cache design"
    - "adaptive caching networks with optimality guarantees"
    - "on the complexity of optimal routing and content caching in heterogeneous networks"
    - "a unified approach to the performance analysis of caching systems"

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)