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: "hybrid ip sdn networking open implementation and experiment management tools"
  Abstract: The introduction of SDN in large-scale IP provider networks is still an open issue and different solutions have been suggested so far. In this paper, we propose a hybrid approach that allows the coexistence of traditional IP routing with SDN based forwarding within the same provider domain. The solution is called OSHI—Open Source Hybrid IP/SDN networking, as we have fully implemented it combining and extending open source software. We discuss the OSHI system architecture and the design and implementation of advanced services like pseudo wires and virtual switches. In addition, we describe a set of open source management tools for the emulation of the proposed solution using either the Mininet emulator or distributed physical testbeds. We refer to this suite of tools as Mantoo (management tools). Mantoo includes an extensible Web-based graphical topology designer, which provides different layered network “views” (e.g., from physical links to service relationships among nodes). The suite can validate an input topology, automatically deploy it over a Mininet emulator or a distributed SDN testbed and allows access to emulated nodes by opening consoles in the web GUI. Mantoo provides also tools to evaluate the performance of the deployed nodes.

Connected through hyperedge HE-1 (induced by source paper "segment routing a comprehensive survey of research activities standardization efforts and implementation results"):
  with members:
    - "srperf a performance evaluation framework for ipv6 segment routing"
    - "an efficient linux kernel implementation of service function chaining for legacy vnfs based on ipv6 segment routing"
    - "node constrained traffic engineering theory and applications"
    - "sdn architecture and southbound apis for ipv6 segment routing enabled wide area networks"
    - "flexible failure detection and fast reroute using ebpf and srv6"
    - "leveraging ebpf for programmable network functions with ipv6 segment routing"
    - "centrality based middlepoint selection for traffic engineering with segment routing"
    - "implementation of virtual network function chaining through segment routing in a linux based nfv infrastructure"

Connected through hyperedge HE-2 (induced by source paper "sdn architecture and southbound apis for ipv6 segment routing enabled wide area networks"):
  with members:
    - "segment routing a comprehensive survey of research activities standardization efforts and implementation results"
    - "traffic engineering with segment routing sdn based architectural design and open source implementation"
    - "pmsr poor man s segment routing a minimalistic approach to segment routing and a traffic engineering use case"
    - "software defined networking a comprehensive survey"

Connected through hyperedge HE-3 (induced by source paper "sdn based resource allocation in mpls networks a hybrid approach"):
  with members:
    - "optimal qos aware network reconfiguration in software defined cloud data centers"
    - "cect computationally efficient congestion avoidance and traffic engineering in software defined cloud data centers"
    - "joint energy efficient and qos aware path allocation and vnf placement for service function chaining"
    - "divide and conquer partitioning ospf networks with sdn"

Connected through hyperedge HE-4 (induced by source paper "on the ip traffic matrix problem in hybrid sdn ospf networks"):
  with members:
    - "sdn partitioning a centralized control plane for distributed routing protocols"
    - "divide and conquer partitioning ospf networks with sdn"

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)