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: "content replication in large distributed caches"
  Abstract: In this paper, we consider the algorithmic task of content replication and request routing in a distributed caching system consisting of a central server and a large number of caches, each with limited storage and service capabilities. We study a time-slotted system where in each time-slot, a large batch of requests has to be matched to a large number of caches, where each request can be served by any cache which stores the requested content. All requests which cannot be served by the caches are served by fetching the requested content from the central server. The goal is to minimize the transmission rate from the central server. We use a novel mapping between our content replication problem and the Knapsack problem to prove a lower bound on the transmission rate for any content replication policy. Using insights obtained from the mapping, we propose a content replication policy - Knapsack Storage - which achieves this lower bound. While it intuitively makes sense to replicate the more popular contents on a larger number of caches, surprisingly, in certain cases, the Knapsack Storage policy chooses not to replicate the most popular contents on the caches at all.

Connected through hyperedge HE-1 (induced by source paper "resource pooling in large scale content delivery systems"):
  with members:
    - "effects of storage heterogeneity in distributed cache systems"
    - "order optimal rate of caching and coded multicasting with random demands"
    - "coded caching for multi level popularity and access"
    - "serving content with unknown demand the high dimensional regime"
    - "multi level coded caching"
    - "online coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"

Connected through hyperedge HE-2 (induced by source paper "effects of storage heterogeneity in distributed cache systems"):
  with members:
    - "resource pooling in large scale content delivery systems"
    - "cache aided heterogeneous networks coverage and delay analysis"
    - "hierarchical coded caching"
    - "impact of traffic mix on caching performance in a content centric network"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "caching with partial adaptive matching"):
  with members:
    - "wireless caching technical misconceptions and business barriers"
    - "coded caching for multi level popularity and access"
    - "on the average performance of caching and coded multicasting with random demands"
    - "multi level coded caching"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

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)