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: "attack planning in the real world"
  Abstract: Assessing network security is a complex and difficult task. Attack graphs have been proposed as a tool to help network administrators understand the potential weaknesses of their network. However, a problem has not yet been addressed by previous work on this subject; namely, how to actually execute and validate the attack paths resulting from the analysis of the attack graph. In this paper we present a complete PDDL representation of an attack model, and an implementation that integrates a planner into a penetration testing tool. This allows to automatically generate attack paths for penetration testing scenarios, and to validate these attacks by executing the corresponding actions -including exploits- against the real target network. We present an algorithm for transforming the information present in the penetration testing tool to the planning domain, and show how the scalability issues of attack graphs can be solved using current planners. We include an analysis of the performance of our solution, showing how our model scales to medium-sized networks and the number of actions available in current penetration testing tools.

Connected through hyperedge HE-1 (induced by source paper "towards automated network mitigation analysis extended"):
  with members:
    - "pomdps make better hackers accounting for uncertainty in penetration testing"
    - "stackelberg vs nash in security games an extended investigation of interchangeability equivalence and uniqueness"
    - "an algorithm to find optimal attack paths in nondeterministic scenarios"
    - "on line planning and scheduling an application to controlling modular printers"
    - "the fast downward planning system"
    - "the ff planning system fast plan generation through heuristic search"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-2 (induced by source paper "towards realistic threat modeling attack commodification irrelevant vulnerabilities and unrealistic assumptions"):
  with members:
    - "economic factors of vulnerability trade and exploitation"
    - "attack potential in impact and complexity"
    - "comparing vulnerability severity and exploits using case control studies"
    - "pomdps make better hackers accounting for uncertainty in penetration testing"

Connected through hyperedge HE-3 (induced by source paper "simulated penetration testing and mitigation analysis"):
  with members:
    - "on line planning and scheduling an application to controlling modular printers"
    - "the fast downward planning system"
    - "the ff planning system fast plan generation through heuristic search"
    - "the computational complexity of probabilistic planning"

Connected through hyperedge HE-4 (induced by source paper "automated attack planning"):
  with members:
    - "pomdps make better hackers accounting for uncertainty in penetration testing"
    - "les pomdp font de meilleurs hackers tenir compte de l incertitude dans les tests de penetration"
    - "heuristic search value iteration for pomdps"
    - "deterministic pomdps revisited"
    - "simulating cyber attacks for fun and profit"
    - "online planning algorithms for pomdps"
    - "probabilistic planning via heuristic forward search and weighted model counting"
    - "perseus randomized point based value iteration for pomdps"

Connected through hyperedge HE-5 (induced by source paper "pomdps make better hackers accounting for uncertainty in penetration testing"):
  with members:
    - "penetration testing pomdp solving"
    - "policy contingent abstraction for robust robot control"
    - "an algorithm to find optimal attack paths in nondeterministic scenarios"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"

Connected through hyperedge HE-6 (induced by source paper "les pomdp font de meilleurs hackers tenir compte de l incertitude dans les tests de penetration"):
  with members:
    - "penetration testing pomdp solving"
    - "policy contingent abstraction for robust robot control"
    - "an algorithm to find optimal attack paths in nondeterministic scenarios"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"

Connected through hyperedge HE-7 (induced by source paper "penetration testing pomdp solving"):
  with members:
    - "deterministic pomdps revisited"
    - "an algorithm to find optimal attack paths in nondeterministic scenarios"

Connected through hyperedge HE-8 (induced by source paper "an algorithm to find optimal attack paths in nondeterministic scenarios"):
  with members:
    - "building computer network attacks"
    - "probabilistic planning via heuristic forward search and weighted model counting"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

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.CR(Cryptography and Security)