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: "a domain independent algorithm for plan adaptation"
  Abstract: The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation - modifying or repairing an old plan so it solves a new problem. In this paper we provide a domain-independent algorithm for plan adaptation, demonstrate that it is sound, complete, and systematic, and compare it to other adaptation algorithms in the literature. Our approach is based on a view of planning as searching a graph of partial plans. Generative planning starts at the graph's root and moves from node to node using plan-refinement operators. In planning by adaptation, a library plan - an arbitrary node in the plan graph - is the starting point for the search, and the plan-adaptation algorithm can apply both the same refinement operators available to a generative planner and can also retract constraints and steps from the plan. Our algorithm's completeness ensures that the adaptation algorithm will eventually search the entire graph and its systematicity ensures that it will do so without redundantly searching any parts of the graph.

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"
    - "on the complexity of case based planning"

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

Connected through hyperedge HE-3 (induced by source paper "generating optimal plans in highly dynamic domains"):
  with members:
    - "flucap a heuristic search planner for first order mdps"

Connected through hyperedge HE-4 (induced by source paper "on the complexity of case based planning"):
  with members:
    - "storing and indexing plan derivations through explanation based analysis of retrieval failures"

Connected through hyperedge HE-5 (induced by source paper "planning by rewriting"):
  with members:
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-6 (induced by source paper "storing and indexing plan derivations through explanation based analysis of retrieval failures"):
  with members:
    - "building and refining abstract planning cases by change of representation language"

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)