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 "planning over chain causal graphs for variables with domains of size 5 is np hard"):
  Abstract: Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. In this paper, we study the complexity of planning in the class Cn of planning problems, characterized by unary operators and directed path causal graphs. Although this is one of the simplest forms of causal graphs a planning problem can have, we show that planning is intractable for Cn (unless P = NP), even if the domains of state variables have bounded size. In particular, we show that plan existence for Ckn is NP-hard for k ≥ 5 by reduction from CNF-SAT. Here, k denotes the upper bound on the size of the state variable domains. Our result reduces the complexity gap for the class Ckn to cases k = 3 and k = 4 only, since C2n is known to be tractable.

Includes members:
  Member "the complexity of planning problems with simple causal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a complete parameterized complexity analysis of bounded planning")
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "structure and complexity in planning with unary operators":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a complete parameterized complexity analysis of bounded planning")

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