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: "network monitoring under strategic disruptions"
  Abstract: This article considers a resource allocation problem for monitoring infrastructure networks facing strategic disruptions. The network operator is interested in determining the minimum number of sensors and a sensing strategy, to ensure a desired detection performance against simultaneous failures induced by a resource-constrained attacker. To address this problem, we formulate a mathematical program with constraints involving the mixed strategy Nash equilibria of an operator-attacker game. The set of player strategies in this game are determined by the network structure and players' resources, and grow combinatorially with the network size. Thus, well-known algorithms for computing equilibria in strategic games cannot be used to evaluate the constraints in our problem. We present a solution approach based on two combinatorial optimization problems, formulated as minimum set cover and maximum set packing problems. By using a combination of game-theoretic and combinatorial arguments, we show that the resulting solution has guarantees on the detection performance and admits a small optimality gap in practical settings. Importantly, this approach is scalable to large-scale networks. We also identify a sufficient condition on the network structure for this solution to be optimal. Finally, we demonstrate the scalability and optimality guarantee of our approach using a set of benchmark water networks.

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.GT(Computer Science and Game Theory)