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: "on the complexity of case based planning"
  Abstract: We analyze the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. We prove that planning from a single case has the same complexity than generative planning (i.e., planning "from scratch"); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete.

Connected through hyperedge HE-1 (induced by source paper "parameterized complexity results for plan reuse"):
  with members:
    - "parameterized complexity and kernel bounds for hard planning problems"
    - "the complexity of planning revisited a parameterized analysis"
    - "the fast downward planning system"
    - "a domain independent algorithm for plan adaptation"

Connected through hyperedge HE-2 (induced by source paper "case based merging techniques in oakplan"):
  with members:
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "a domain independent algorithm for plan adaptation"

Connected through hyperedge HE-3 (induced by source paper "algorithms and limits for compact plan representations"):
  with members:
    - "on the size of data structures used in symbolic model checking"
    - "random access to grammar compressed strings"
    - "the complexity of planning problems with simple causal graphs"
    - "complexity issues in finding succinct solutions of pspace complete problems"
    - "ordered landmarks in planning"
    - "structure and complexity in planning with unary operators"
    - "on the compilability and expressive power of propositional planning formalisms"
    - "space efficiency of propositional knowledge representation formalisms"

Connected through hyperedge HE-4 (induced by source paper "on the size of data structures used in symbolic model checking"):
  with members:
    - "a knowledge compilation map"

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)