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 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.

Includes members:
  Member "pddl2 1 an extension to pddl for expressing temporal planning domains":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "the metric ff planning system translating ignoring delete lists to numeric state variables":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "the 3rd international planning competition results and analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "efficient implementation of the plan graph in stan":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "marvin a heuristic search planner with online macro action learning")
  Member "the automatic inference of state invariants in tim":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "guarantees for sound abstractions for generalized planning extended paper")
  Member "flaw selection strategies for partial order planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "engineering a conformant probabilistic planner")
  Member "accelerating partial order planners some techniques for effective search control and pruning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "vhpop versatile heuristic partial order planner")

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)