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: "towards wire speed platform agnostic control of openflow switches"
  Abstract: The possibility to offload, via a platform-agnostic specification, the execution of (some/part of the) control functions down to the switch and operate them at wire speed based on packet level events, would yield significant benefits in terms of control latency and reaction times, meanwhile retaining the SDN-type ability to program and instantiate a desired network operation from a central controller. While programmability inside the switches, at wire speed and using platform-independent abstractions, of “any possible” control function seems well beyond the OpenFlow capabilities, in this paper 1 we argue that a non trivial sub-class of stateful control functions, namely those that can be abstracted in terms of Mealy (Finite State) Machines, is already compatible with off-the-shelf OpenFlow version 1.1+ Hardware with marginal architectural modifications. With minimal additional hardware circuitry, the above sub-class can be extended to include support for bidirectional/cross-flow state handling. We demonstrate the viability of our proposed approach via two proof-of-concept implementations (hardware and software), and we show how some stateful control functionalities frequently exploited in network protocols are readily deployed using our application programming interface.

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"
    - "detour planning for fast and reliable failure recovery in sdn with openstate"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "a decentralized approach to software defined networks sdns"):
  with members:
    - "a monte carlo approach to lifespan failure performance analysis of the network fabric in modular data centers"
    - "quality of experience qoe beyond quality of service qos as its baseline qoe at the interface of experience domains"
    - "smartpacket re distributing the routing intelligence among network components in sdns"
    - "tree decompositions and social graphs"
    - "millions of little minions using packets for low latency network programming and visibility extended version"
    - "a geometric distance oracle for large real world graphs"
    - "programming protocol independent packet processors"

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)