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: "sdn partitioning a centralized control plane for distributed routing protocols"
  Abstract: Hybrid IP networks that use both control paradigms—distributed and centralized—promise the best of two worlds: 1) programmability of software-defined networking (SDN) and 2) reliability and fault tolerance of distributed routing protocols, like open shortest path first (OSPF). Typically, a hybrid network deploys SDN to control prioritized traffic and OSPF to assure care-free operation of best effort traffic. We propose a new hybrid network architecture, called SDN partitioning (SDNp), which establishes centralized control over the distributed routing protocol by partitioning the topology into sub-domains with SDN-enabled border nodes. In our approach, OSPF’s routing updates have to traverse SDN border nodes to reach neighboring sub-domains. This allows the central controller to modify how sub-domains view one another, which in turn allows to steer inter-sub-domain traffic. The degree of dynamic control against simplicity of OSPF can be traded off by adjusting the size of the sub-domains. This paper studies the technical requirements, presents a novel scheme for balanced topology partitioning, and provides the corresponding network management models for SDNp. Our performance evaluation shows that—already in its minimum configuration with two sub-domains—SDNp provides significant improvements in all respects compared to legacy routing protocols, whereas smaller sub-domains provide network control capabilities comparable to full SDN deployment.

Connected through hyperedge HE-1 (induced by source paper "on the ip traffic matrix problem in hybrid sdn ospf networks"):
  with members:
    - "hybrid ip sdn networking open implementation and experiment management tools"
    - "divide and conquer partitioning ospf networks with sdn"

Connected through hyperedge HE-2 (induced by source paper "link capacity planning for fault tolerant operation in hybrid sdn ospf networks"):
  with members:
    - "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)