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: "reactive failure mitigation through seamless migration in telecom infrastructure networks"
  Abstract: Various methods are proposed in the literature to mitigate the failures in an infrastructure network. Failure mitigation can be carried out in an active or passive manner. In active manner, live backups provide the required reliability. Due to the high cost of active backups, failures can be mitigated in a reactive manner where mitigation starts when a function fails. In this paper, network functions are divided into two classes of essential (i.e., core) functions and additive (i.e., service) functions. Core functions need active backups and cannot tolerate any failure. However, additive functions do not require backups and their absence is tolerable in short periods. Maximum tolerable (function) absence time (TAT) is a measure used for their reliability level. In our model and within the mitigation process, first, the backup host to migrate the failed function is selected. Then, the state of the function is migrated. The process should be carried out in less than TAT. An optimization problem is formulated investigating cost-effective failure mitigation of additive functions. The problem is of mixed integer non convex form. To tackle the computational complexity, it is bisected into two back-to-back leader-follower parts. The leader selects the migration destinations and the follower divides network resources among functions for migration. These problems are both NP-hard. For the leader problem, a central heuristic based on the Viterbi algorithm suggested. The follower problem is converted into two convex sub-problems. The validity of the proposed algorithms is proved via extensive numerical results.

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)