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: "partial order planning with concurrent interacting actions"
  Abstract: In order to generate plans for agents with multiple actuators, agent teams, or distributed controllers, we must be able to represent and plan using concurrent actions with interacting effects. This has historically been considered a challenging task requiring a temporal planner with the ability to reason explicitly about time. We show that with simple modifications, the STRIPS action representation language can be used to represent interacting actions. Moreover, algorithms for partial-order planning require only small modifications in order to be applied in such multiagent domains. We demonstrate this fact by developing a sound and complete partial-order planner for planning with concurrent interacting actions, POMP, that extends existing partial-order planners in a straightforward way. These results open the way to the use of partial-order planners for the centralized control of cooperative multiagent systems.

Connected through hyperedge HE-1 (induced by source paper "solving multiagent planning problems with concurrent conditional effects"):
  with members:
    - "fmap distributed cooperative multi agent planning"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the fast downward planning system"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-2 (induced by source paper "cooperative multi agent planning a survey"):
  with members:
    - "fmap distributed cooperative multi agent planning"
    - "an approach to multi agent planning with incomplete information"
    - "a flexible coupling approach to multi agent planning under incomplete information"
    - "game theoretic approach for non cooperative planning"
    - "a formal analysis of required cooperation in multi agent planning"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the fast downward planning system"
    - "ordered landmarks in planning"

Connected through hyperedge HE-3 (induced by source paper "a flexible coupling approach to multi agent planning under incomplete information"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the fast downward planning system"
    - "a framework for sequential planning in multi agent settings"
    - "vhpop versatile heuristic partial order planner"
    - "monitoring teams by overhearing a multi agent plan recognition approach"
    - "the ff planning system fast plan generation through heuristic search"
    - "towards flexible teamwork"

Connected through hyperedge HE-4 (induced by source paper "fmap distributed cooperative multi agent planning"):
  with members:
    - "an approach to multi agent planning with incomplete information"
    - "a flexible coupling approach to multi agent planning under incomplete information"
    - "planning under continuous time and resource uncertainty a challenge for ai"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "the 3rd international planning competition results and analysis"
    - "the ff planning system fast plan generation through heuristic search"

Connected through hyperedge HE-5 (induced by source paper "an approach to multi agent planning with incomplete information"):
  with members:
    - "vhpop versatile heuristic partial order planner"
    - "the ff planning system fast plan generation through heuristic search"
    - "towards flexible teamwork"

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)