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: "single controller stochastic games for optimized moving target defense"
  Abstract: Moving target defense (MTD) techniques that enable a system to randomize its configuration to thwart prospective attacks are an effective security solution for tomorrow's wireless networks. However, there is a lack of analytical techniques that enable one to quantify the benefits and tradeoffs of MTDs. In this paper, a novel approach for implementing MTD techniques that can be used to randomize cryptographic techniques and keys in wireless networks is proposed. In particular, the problem is formulated as a stochastic game in which a base station (BS), acting as a defender seeks to strategically change its cryptographic techniques and keys in an effort to deter an attacker that is trying to eavesdrop on the data. The game is shown to exhibit a single-controller property in which only one player, the defender, controls the state of the game. For this game, the existence and properties of the Nash equilibrium are studied, in the presence of a defense cost for using MTD. Then, a practical algorithm for deriving the equilibrium MTD strategies is derived. Simulation results show that the proposed game-theoretic MTD framework can significantly improve the overall utility of the defender, while enabling effective randomization over cryptographic techniques.

Connected through hyperedge HE-1 (induced by source paper "bounding fixed points of set based bellman operator and nash equilibria of stochastic games"):
  with members:
    - "stopping criteria for value and strategy iteration on concurrent stochastic reachability games"
    - "online reinforcement learning in stochastic games"
    - "fast planning in stochastic games"

Connected through hyperedge HE-2 (induced by source paper "drones in distress a game theoretic countermeasure for protecting uavs against gps spoofing"):
  with members:
    - "dynamic mobility aware interference avoidance for aerial base stations in cognitive radio networks"
    - "a game of drones cyber physical security of time critical uav applications with cumulative prospect theory perceptions and valuations"
    - "beyond 5g with uavs foundations of a 3d wireless cellular network"
    - "machine learning for wireless connectivity and security of cellular connected uavs"
    - "robust deep reinforcement learning for security and safety in autonomous vehicle systems"
    - "cyber physical security and safety of autonomous connected vehicles optimal control meets multi armed bandit learning"
    - "mobile unmanned aerial vehicles uavs for energy efficient internet of things communications"
    - "caching in the sky proactive deployment of cache enabled unmanned aerial vehicles for optimized quality of experience"

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)