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 "towards automated network mitigation analysis extended"):
  Abstract: Penetration testing is a well-established practical concept for the identification of potentially exploitable security weaknesses and an important component of a security audit. Providing a holistic security assessment for networks consisting of several hundreds hosts is hardly feasible though without some sort of mechanization. Mitigation, prioritizing counter-measures subject to a given budget, currently lacks a solid theoretical understanding and is hence more art than science. In this work, we propose the first approach for conducting comprehensive what-if analyses in order to reason about mitigation in a conceptually well-founded manner. To evaluate and compare mitigation strategies, we use simulated penetration testing, i.e., automated attack-finding, based on a network model to which a subset of a given set of mitigation actions, e.g., changes to the network topology, system updates, configuration changes etc. is applied. Using Stackelberg planning, we determine optimal combinations that minimize the maximal attacker success (similar to a Stackelberg game), and thus provide a well-founded basis for a holistic mitigation strategy. We show that these Stackelberg planning models can largely be derived from network scan, public vulnerability databases and manual inspection with various degrees of automation and detail, and we simulate mitigation analysis on networks of different size and vulnerability.

Includes members:
  Member "pomdps make better hackers accounting for uncertainty in penetration testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "autonomous intelligent cyber defense agent aica reference architecture release 2 0")
  Member "attack planning in the real world":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards realistic threat modeling attack commodification irrelevant vulnerabilities and unrealistic assumptions")
  Member "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "spatial temporal moving target defense a markov stackelberg game model")
  Member "an algorithm to find optimal attack paths in nondeterministic scenarios":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "autonomous intelligent cyber defense agent aica reference architecture release 2 0")
  Member "on line planning and scheduling an application to controlling modular printers":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simulated penetration testing and mitigation analysis")
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "the computational complexity of probabilistic planning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a rate distortion framework for explaining neural network decisions")

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)