human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "game theoretic analysis of cyber deception evidence based strategies and dynamic risk mitigation"):
  Abstract: Deception is a technique to mislead human or computer systems by manipulating beliefs and information. For the applications of cyber deception, non-cooperative games become a natural choice of models to capture the adversarial interactions between the players and quantitatively characterizes the conflicting incentives and strategic responses. In this chapter, we provide an overview of deception games in three different environments and extend the baseline signaling game models to include evidence through side-channel knowledge acquisition to capture the information asymmetry, dynamics, and strategic behaviors of deception. We analyze the deception in binary information space based on a signaling game framework with a detector that gives off probabilistic evidence of the deception when the sender acts deceptively. We then focus on a class of continuous one-dimensional information space and take into account the cost of deception in the signaling game. We finally explore the multi-stage incomplete-information Bayesian game model for defensive deception for advanced persistent threats (APTs). We use the perfect Bayesian Nash equilibrium (PBNE) as the solution concept for the deception games and analyze the strategic equilibrium behaviors for both the deceivers and the deceivees.

Includes members:
  Member "adaptive strategic cyber defense for advanced persistent threats in critical infrastructure networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "game theory for cyber deception a tutorial")
  Member "a game theoretic foundation of deception knowledge acquisition and fundamental limits":
    also connected through other hyperedges:
      (none)
  Member "a mean field stackelberg game approach for obfuscation adoption in empirical risk minimization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "prospect theoretic analysis of privacy preserving mechanism")
  Member "proactive defense against physical denial of service attacks using poisson signaling games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adaptive honeypot engagement through reinforcement learning of semi markov decision processes")
  Member "a dynamic game analysis and design of infrastructure network protection and recovery 125":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal secure two layer iot network design")
  Member "a game theoretic taxonomy and survey of defensive deception for cybersecurity and privacy":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "game theory for cyber deception a tutorial")
  Member "a stackelberg game perspective on the conflict between machine learning and data obfuscation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "game theory for cyber deception a tutorial")
  Member "deception by design evidence based signaling games for network defense":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "game theory for cyber deception a tutorial")

Question: Please tell me which class the source paper 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.CR(Cryptography and Security)