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: "planning through stochastic local search and temporal action graphs in lpg"
  Abstract: We present some techniques for planning in domains specified with the recent standard language PDDL2.1, supporting "durative actions" and numerical quantities. These techiques are implemented in LPG, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). LPG is an incremental, any time system producing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called "Temporal Action Graphs" (TA-graphs). This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation. The experimental results of the 3rd IPC, as well as further results presented in this paper, show that our techniques can be very effective. Often LPG outperforms all other fully-automated planners of the 3rd IPC in terms of speed to derive a solution, or quality of the solutions that can be produced.

Connected through hyperedge HE-1 (induced by source paper "automated algorithm selection survey and perspectives"):
  with members:
    - "coco a platform for comparing continuous optimizers in a black box setting"
    - "aslib a benchmark library for algorithm selection"
    - "claspfolio 2 advances in algorithm selection for answer set programming"
    - "auto weka combined selection and hyperparameter optimization of classification algorithms"
    - "analyzing search topology without running any search on the connection between causal graphs and h"
    - "the fast downward planning system"

Connected through hyperedge HE-2 (induced by source paper "an empirical study of the effects of spurious transitions on abstraction based heuristics"):
  with members:
    - "the fast downward planning system"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-3 (induced by source paper "case based merging techniques in oakplan"):
  with members:
    - "on the complexity of case based planning"
    - "the ff planning system fast plan generation through heuristic search"
    - "a domain independent algorithm for plan adaptation"

Connected through hyperedge HE-4 (induced by source paper "finding similar diverse solutions in answer set programming"):
  with members:
    - "temporal phylogenetic networks and logic programming"
    - "weight constraints as nested expressions"
    - "on the expressibility of stable logic programming"

Connected through hyperedge HE-5 (induced by source paper "on the tractability of minimal model computation for some cnf theories"):
  with members:
    - "on the complexity of identifying head elementary set free programs"
    - "computing minimal models stable models and answer sets"

Connected through hyperedge HE-6 (induced by source paper "analyzing search topology without running any search on the connection between causal graphs and h"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "planning over chain causal graphs for variables with domains of size 5 is np hard"
    - "the complexity of planning problems with simple causal graphs"
    - "the fast downward planning system"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "ordered landmarks in planning"
    - "structure and complexity in planning with unary operators"
    - "the ff planning system fast plan generation through heuristic search"

Connected through hyperedge HE-7 (induced by source paper "on line planning and scheduling an application to controlling modular printers"):
  with members:
    - "regression with respect to sensing actions and partial states"
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-8 (induced by source paper "planning with partial preference models"):
  with members:
    - "learning probabilistic hierarchical task networks to capture user preferences"
    - "planning with preferences using logic programming"
    - "cp nets a tool for representing and reasoning with conditional ceteris paribus preference statements"
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "decision theoretic planning structural assumptions and computational leverage"

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)