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: "taming numbers and durations in the model checking integrated planning system"
  Abstract: The Model Checking Integrated Planning System (MIPS) is a temporal least commitment heuristic search planner based on a flexible object-oriented workbench architecture. Its design clearly separates explicit and symbolic directed exploration algorithms from the set of on-line and off-line computed estimates and associated data structures.#R##N##R##N#MIPS has shown distinguished performance in the last two international planning competitions. In the last event the description language was extended from pure propositional planning to include numerical state variables, action durations, and plan quality objective functions. Plans were no longer sequences of actions but time-stamped schedules.#R##N##R##N#As a participant of the fully automated track of the competition, MIPS has proven to be a general system; in each track and every benchmark domain it efficiently computed plans of remarkable quality. This article introduces and analyzes the most important algorithmic novelties that were necessary to tackle the new layers of expressiveness in the benchmark problems and to achieve a high level of performance.#R##N##R##N#The extensions include critical path analysis of sequentially generated plans to generate corresponding optimal parallel plans. The linear time algorithm to compute the parallel plan bypasses known NP hardness results for partial ordering by scheduling plans with respect to the set of actions and the imposed precedence relations. The efficiency of this algorithm also allows us to improve the exploration guidance: for each encountered planning state the corresponding approximate sequential plan is scheduled.#R##N##R##N#One major strength of MIPS is its static analysis phase that grounds and simplifies parameterized predicates, functions and operators, that infers knowledge to minimize the state description length, and that detects domain object symmetries. The latter aspect is analyzed in detail.#R##N##R##N#MIPS has been developed to serve as a complete and optimal state space planner, with admissible estimates, exploration engines and branching cuts. In the competition version, however, certain performance compromises had to be made, including floating point arithmetic, weighted heuristic search exploration according to an inadmissible estimate and parameterized optimization.

Connected through hyperedge HE-1 (induced by source paper "a hybrid lp rpg heuristic for modelling numeric resource flows in planning"):
  with members:
    - "colin planning with continuous linear numeric change"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "loosely coupled formulations for automated planning an integer programming perspective"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "the deterministic part of ipc 4 an overview"
    - "ordered landmarks in planning"
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-2 (induced by source paper "colin planning with continuous linear numeric change"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "compiling uncertainty away in conformant planning problems with bounded width"
    - "a heuristic search approach to planning with continuous resources in stochastic domains"
    - "modelling mixed discrete continuous domains for planning"
    - "the fast downward planning system"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "the deterministic part of ipc 4 an overview"
    - "sapa a multi objective metric temporal planner"

Connected through hyperedge HE-3 (induced by source paper "the complexity of planning revisited a parameterized analysis"):
  with members:
    - "augmenting tractable fragments of abstract argumentation"
    - "the complexity of planning problems with simple causal graphs"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "structure and complexity in planning with unary operators"

Connected through hyperedge HE-4 (induced by source paper "resource optimal planning for an autonomous planetary vehicle"):
  with members:
    - "planning under continuous time and resource uncertainty a challenge for ai"
    - "modelling mixed discrete continuous domains for planning"

Connected through hyperedge HE-5 (induced by source paper "engineering benchmarks for planning the domains used in the deterministic part of ipc 4"):
  with members:
    - "supply restoration in power distribution systems a case study in integrating model based diagnosis and repair planning"
    - "the fast downward planning system"
    - "an approach to temporal planning and scheduling in domains with predictable exogenous events"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "the deterministic part of ipc 4 an overview"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "the 3rd international planning competition results and analysis"

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"
    - "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"
    - "on reasonable and forced goal orderings and their use in an agenda driven planning algorithm"

Connected through hyperedge HE-7 (induced by source paper "the deterministic part of ipc 4 an overview"):
  with members:
    - "supply restoration in power distribution systems a case study in integrating model based diagnosis and repair planning"
    - "engineering benchmarks for planning the domains used in the deterministic part of ipc 4"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "the 3rd international planning competition results and analysis"):
  with members:
    - "sapa a multi objective metric temporal planner"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "vhpop versatile heuristic partial order planner"
    - "the metric ff planning system translating ignoring delete lists to numeric state variables"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "a critical assessment of benchmark comparison in planning"
    - "the ff planning system fast plan generation through heuristic search"

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)