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: "jamming in the internet of things a game theoretic perspective"
  Abstract: Due to its scale and largely interconnected nature, the Internet of Things (IoT) will be vulnerable to a number of security threats that range from physical layer attacks to network layer attacks. In this paper, a novel anti-jamming strategy for OFDM-based IoT systems is proposed which enables an IoT controller to protect the IoT devices against a malicious radio jammer. The interaction between the controller node and the jammer is modeled as a Colonel Blotto game with continuous and asymmetric resources in which the IoT controller, acting as defender, seeks to thwart the jamming attack by distributing its power among the subcarries in a smart way to decrease the aggregate bit error rate (BER) caused by the jammer. The jammer, on the other hand, aims at disrupting the system performance by allocating jamming power to different frequency bands. To solve the game, an evolutionary algorithm is proposed which can find a mixed-strategy Nash equilibrium of the Blotto game. Simulation results show that the proposed algorithm enables the IoT controller to maintain the BER above an acceptable threshold, thereby preserving the IoT network performance in the presence of malicious jamming.

Connected through hyperedge HE-1 (induced by source paper "flipin a game theoretic cyber insurance framework for incentive compatible cyber risk management of internet of things"):
  with members:
    - "dynamic psychological game theory for secure internet of battlefield things iobt systems"
    - "defense against advanced persistent threats in dynamic cloud storage a colonel blotto game approach"
    - "dynamic connectivity game for adversarial internet of battlefield things systems"
    - "a colonel blotto game for interdependence aware cyber physical systems security in smart cities"
    - "moving target defense for web applications using bayesian stackelberg games"
    - "flip the cloud cyber physical signaling games in the presence of advanced persistent threats"
    - "a game theoretic model for defending against stealthy attacks with limited resources"
    - "internet of things iot a vision architectural elements and future directions"

Connected through hyperedge HE-2 (induced by source paper "defense against advanced persistent threats in dynamic cloud storage a colonel blotto game approach"):
  with members:
    - "when to reset your keys optimal timing of security updates via learning"
    - "flip the cloud cyber physical signaling games in the presence of advanced persistent threats"
    - "a game theoretic model for defending against stealthy attacks with limited resources"
    - "playing atari with deep reinforcement learning"
    - "reinforcement learning a survey"

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.IT(Information Theory)