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: "near optimal routing protection for in band software defined heterogeneous networks"
  Abstract: Facing the spectrum supply–demand gap, heterogeneous network (HetNet) is a promising approach to achieve drastic gains in network coverage and capacity compared with macro-only networks, thus making it especially attractive to network operators. On the other hand, software-defined networking brings a number of advantages along with many challenges. One particular concern is on the resilience for in-band fashioned control plane. Existing approaches mainly rely on a  local rerouting  policy when performing the routing protection for the target sessions in software-defined networks. However, such a policy would potentially bring congestions in the neighbouring links of the failed one. To this end, we study a weighted cost-minimization problem, where the traffic load balancing and control-channel setup cost are jointly considered. Because this problem is NP-hard, we first propose a near-optimal  Markov approximation -based approach for in-band-fashioned software-defined HetNets. We then extend our solution to an online case that handles a single-link failure. We also conduct theoretical analysis on the performance fluctuation due to the single-link failure. We finally carry out experiments by experimental simulation. The extensive numerical results show that the proposed algorithm has fast convergence and high efficiency in resource utilization.

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.DC(Distributed, Parallel, and Cluster Computing)