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 inspection for detecting strategic attacks"
  Abstract: We study the generic problem of strategic network inspection, in which a defender (inspection agency) is tasked with detecting the presence of multiple attacks in the network. The defender has access to a limited number of detectors that she can randomly position in the network to monitor its components. We address the question of determining a randomized inspection strategy with minimum number of detectors that ensures a target expected attack detection rate. To address this question, we formulate a mathematical program with constraints involving the Nash equilibria of a large-scale strategic game between the defender and attacker. We develop a novel approach to construct an approximate equilibrium strategy profile of the game by utilizing solutions of minimum set cover and maximum set packing problems. This construction can be viewed as a generalization of some of the previously known results in security games, and is scalable to large-scale networks. Importantly, by using game-theoretic and combinatorial arguments, we provide optimality guarantees of our solution to the inspection problem in terms of the number of detectors and attack detection rate. We also derive a structural result on the attack detection rate in equilibrium, which can be applied to further improve these guarantees through a column generation procedure.

Connected through hyperedge HE-1 (induced by source paper "a network monitoring game with heterogeneous component criticality levels"):
  with members:
    - "on the power of randomization in network interdiction"

Connected through hyperedge HE-2 (induced by source paper "network monitoring under strategic disruptions"):
  with members:
    - "robust monotone submodular function maximization"
    - "on the power of randomization in network interdiction"

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)