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: "penetration testing pomdp solving"
  Abstract: Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing without a prohibitive amount of human labor. A key question then is how to generate the attacks. This is naturally formulated as a planning problem. Previous work (Lucangeli et al. 2010) used classical planning and hence ignores all the incomplete knowledge that characterizes hacking. More recent work (Sarraute et al. 2011) makes strong independence assumptions for the sake of scaling, and lacks a clear formal concept of what the attack planning problem actually is. Herein, we model that problem in terms of partially observable Markov decision processes (POMDP). This grounds penetration testing in a well-researched formalism, highlighting important aspects of this problem's nature. POMDPs allow to model information gathering as an integral part of the problem, thus providing for the first time a means to intelligently mix scanning actions with actual exploits.

Connected through hyperedge HE-1 (induced by source paper "autonomous penetration testing using reinforcement learning"):
  with members:
    - "simulated penetration testing and mitigation analysis"
    - "pomdps make better hackers accounting for uncertainty in penetration testing"
    - "the arcade learning environment an evaluation platform for general agents"
    - "automated attack planning"
    - "playing atari with deep reinforcement learning"
    - "simulating cyber attacks for fun and profit"

Connected through hyperedge HE-2 (induced by source paper "attack graph obfuscation"):
  with members:
    - "pomdps make better hackers accounting for uncertainty in penetration testing"
    - "the fast downward planning system"

Connected through hyperedge HE-3 (induced by source paper "pomdps make better hackers accounting for uncertainty in penetration testing"):
  with members:
    - "attack planning in the real world"
    - "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-4 (induced by source paper "les pomdp font de meilleurs hackers tenir compte de l incertitude dans les tests de penetration"):
  with members:
    - "attack planning in the real world"
    - "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"

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.AI(Artificial Intelligence)