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 reasonable and forced goal orderings and their use in an agenda driven planning algorithm"
  Abstract: The paper addresses the problem of computing goal orderings, which is one of the longstanding issues in AI planning. It makes two new contributions. First, it formally defines and discusses two different goal orderings, which are called the reasonable and the forced ordering. Both orderings are defined for simple STRIPS operators as well as for more complex ADL operators supporting negation and conditional effects. The complexity of these orderings is investigated and their practical relevance is discussed. Secondly, two different methods to compute reasonable goal orderings are developed. One of them is based on planning graphs, while the other investigates the set of actions directly. Finally, it is shown how the ordering relations, which have been derived for a given set of goals G, can be used to compute a so-called goal agenda that divides G into an ordered set of subgoals. Any planner can then, in principle, use the goal agenda to plan for increasing sets of subgoals. This can lead to an exponential complexity reduction, as the solution to a complex planning problem is found by solving easier subproblems. Since only a polynomial overhead is caused by the goal agenda computation, a potential exists to dramatically speed up planning algorithms as we demonstrate in the empirical evaluation, where we use this method in the IPP planner.

Connected through hyperedge HE-1 (induced by source paper "planning based on classification by induction graph"):
  with members:
    - "scaling up heuristic planning with relational decision trees"

Connected through hyperedge HE-2 (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"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-3 (induced by source paper "the lama planner guiding cost based anytime planning with landmarks"):
  with members:
    - "anytime heuristic search"
    - "the fast downward planning system"
    - "ordered landmarks in planning"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "engineering a conformant probabilistic planner"):
  with members:
    - "decision theoretic planning with non markovian rewards"
    - "approximate policy iteration with a policy language bias solving relational markov decision processes"
    - "mgpt a probabilistic planner based on heuristic search"
    - "vhpop versatile heuristic partial order planner"
    - "the ff planning system fast plan generation through heuristic search"
    - "decision theoretic planning structural assumptions and computational leverage"
    - "flaw selection strategies for partial order planning"

Connected through hyperedge HE-5 (induced by source paper "divide and evolve a new memetic scheme for domain independent temporal planning"):
  with members:
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-6 (induced by source paper "where ignoring delete lists works local search topology in planning benchmarks"):
  with members:
    - "engineering benchmarks for planning the domains used in the deterministic part of ipc 4"
    - "the deterministic part of ipc 4 an overview"
    - "taming numbers and durations in the model checking integrated planning system"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "the 3rd international planning competition results and analysis"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "the grt planning system backward heuristic construction in forward state space planning"

Connected through hyperedge HE-7 (induced by source paper "ordered landmarks in planning"):
  with members:
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "the 3rd international planning competition results and analysis"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "the ff planning system fast plan generation through heuristic search"
    - "the automatic inference of state invariants in tim"

Connected through hyperedge HE-8 (induced by source paper "taming numbers and durations in the model checking integrated planning system"):
  with members:
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the ff planning system fast plan generation through heuristic search"
    - "obdd based universal planning for synchronized agents in non deterministic domains"
    - "efficient implementation of the plan graph in stan"
    - "computational aspects of reordering plans"
    - "the automatic inference of state invariants in tim"

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)