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: "detour planning for fast and reliable failure recovery in sdn with openstate"
  Abstract: A reliable and scalable mechanism to provide protection against a link or node failure has additional requirements in the context of SDN and OpenFlow. Not only it has to minimize the load on the controller, but it must be able to react even when the controller is unreachable. In this paper we present a protection scheme based on precomputed backup paths and inspired by MPLS “crankback” routing, that guarantees instantaneous recovery times and aims at zero packet-loss after failure detection, regardless of controller reachability, even when OpenFlow's “fast-failover” feature cannot be used. The proposed mechanism is based on OpenState, an OpenFlow extension that allows a programmer to specify how forwarding rules should autonomously adapt in a stateful fashion, reducing the need to rely on remote controllers. We present the scheme as well as two different formulations for the computation of backup paths.

Connected through hyperedge HE-1 (induced by source paper "a survey on data plane flexibility and programmability in software defined networking"):
  with members:
    - "towards programmable network dynamics a chemistry inspired abstraction for hardware design"
    - "open packet processor a programmable architecture for wire speed platform independent stateful in network processing"
    - "splitarchitecture sdn for the carrier domain"
    - "software defined networking a comprehensive survey"
    - "network function virtualization based on fpgas a framework for all programmable network devices"
    - "towards wire speed platform agnostic control of openflow switches"

Connected through hyperedge HE-2 (induced by source paper "bounds for energy efficient survivable ip over wdm networks with network coding"):
  with members:
    - "software defined optical networks sdons a comprehensive survey"
    - "network coding based protection strategy against node failures"
    - "network protection codes against link failures using network coding"

Connected through hyperedge HE-3 (induced by source paper "bringing sdn to the mobile edge"):
  with members:
    - "software defined networking a comprehensive survey"
    - "softcell taking control of cellular core networks"

Connected through hyperedge HE-4 (induced by source paper "near optimal routing protection for in band software defined heterogeneous networks"):
  with members:
    - "traffic management applications for stateful sdn data plane"
    - "controller selection in a wireless mesh sdn under network partitioning and merging scenarios"
    - "achieving maximum energy efficiency in multi relay ofdma cellular networks a fractional programming approach"
    - "on diagnosis of forwarding plane via static forwarding rules in software defined networks"

Connected through hyperedge HE-5 (induced by source paper "computing backup forwarding rules in software defined networks"):
  with members:
    - "spider fault resilient sdn pipeline with recovery delay guarantees"

Connected through hyperedge HE-6 (induced by source paper "spider fault resilient sdn pipeline with recovery delay guarantees"):
  with members:
    - "traffic management applications for stateful sdn data plane"

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)