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: "adaptive replication in distributed content delivery networks"
  Abstract: We address the problem of content replication in large distributed content delivery networks, composed of a data center assisted by many small servers with limited capabilities and located at the edge of the network. The objective is to optimize the placement of contents on the servers to offload as much as possible the data center. We model the system constituted by the small servers as a loss network, each loss corresponding to a request to the data center. Based on large system / storage behavior, we obtain an asymptotic formula for the optimal replication of contents and propose adaptive schemes related to those encountered in cache networks but reacting here to loss events, and faster algorithms generating virtual events at higher rate while keeping the same target replication. We show through simulations that our adaptive schemes outperform significantly standard replication strategies both in terms of loss rates and adaptation speed.

Connected through hyperedge HE-1 (induced by source paper "paging with multiple caches"):
  with members:
    - "serving content with unknown demand the high dimensional regime"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "impact of traffic mix on caching performance in a content centric network"
    - "fundamental limits of caching"
    - "small world file sharing communities"
    - "competitive paging algorithms"

Connected through hyperedge HE-2 (induced by source paper "caching in wireless small cell networks a storage bandwidth tradeoff"):
  with members:
    - "co primary multi operator resource sharing for small cell networks"
    - "modeling and analysis of content caching in wireless small cell networks"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "five disruptive technology directions for 5g"
    - "offloading in heterogeneous networks modeling analysis and design insights"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-3 (induced by source paper "modeling and analysis of content caching in wireless small cell networks"):
  with members:
    - "caching eliminates the wireless bottleneck in video aware wireless networks"
    - "cache enabled small cell networks modeling and tradeoffs"
    - "living on the edge the role of proactive caching in 5g wireless networks"
    - "cache enabled opportunistic cooperative mimo for video streaming in wireless systems"
    - "coding for caches in the plane"
    - "five disruptive technology directions for 5g"
    - "offloading in heterogeneous networks modeling analysis and design insights"

Connected through hyperedge HE-4 (induced by source paper "online budgeted repeated matching"):
  with members:
    - "serving content with unknown demand the high dimensional regime"
    - "near optimal online algorithms for dynamic resource allocation problems"
    - "online advertisement optimization and stochastic networks"
    - "online stochastic packing applied to display ad allocation"
    - "algorithms for secretary problems on graphs and hypergraphs"

Connected through hyperedge HE-5 (induced by source paper "serving content with unknown demand the high dimensional regime"):
  with members:
    - "impact of traffic mix on caching performance in a content centric network"
    - "small world file sharing communities"

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)