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: "the deterministic part of ipc 4 an overview"
  Abstract: We provide an overview of the organization and results of the deterministic part of the 4th International Planning Competition, i.e., of the part concerned with evaluating systems doing deterministic planning. IPC-4 attracted even more competing systems than its already large predecessors, and the competition event was revised in several important respects. After giving an introduction to the IPC, we briefly explain the main differences between the deterministic part of IPC-4 and its predecessors. We then introduce formally the language used, called PDDL2.2 that extends PDDL2.1 by derived predicates and timed initial literals. We list the competing systems and overview the results of the competition. The entire set of data is far too large to be presented in full. We provide a detailed summary; the complete data is available in an online appendix. We explain how we awarded the competition prizes.

Connected through hyperedge HE-1 (induced by source paper "handling pddl3 0 state trajectory constraints with temporal landmarks"):
  with members:
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "ordered landmarks in planning"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-2 (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"
    - "ordered landmarks in planning"
    - "sapa a multi objective metric temporal planner"
    - "taming numbers and durations in the model checking integrated planning system"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-3 (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"
    - "sapa a multi objective metric temporal planner"
    - "taming numbers and durations in the model checking integrated planning system"

Connected through hyperedge HE-4 (induced by source paper "sap speaks pddl exploiting a software engineering model for planning in business process management"):
  with members:
    - "compiling uncertainty away in conformant planning problems with bounded width"
    - "the fast downward planning system"
    - "planning graph heuristics for belief space search"
    - "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-5 (induced by source paper "structure and problem hardness goal asymmetry and dpll proofs in sat based planning"):
  with members:
    - "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"
    - "beyond hypertree width decomposition methods without decompositions"
    - "ordered landmarks in planning"
    - "towards understanding and harnessing the potential of clause learning"
    - "the 3rd international planning competition results and analysis"
    - "planning through stochastic local search and temporal action graphs in lpg"
    - "a critical assessment of benchmark comparison in planning"

Connected through hyperedge HE-6 (induced by source paper "marvin a heuristic search planner with online macro action learning"):
  with members:
    - "the fast downward planning system"
    - "where ignoring delete lists works local search topology in planning benchmarks"
    - "macro ff improving ai planning with automatically learned macro operators"
    - "the 3rd international planning competition results and analysis"
    - "the ff planning system fast plan generation through heuristic search"
    - "efficient implementation of the plan graph in stan"

Connected through hyperedge HE-7 (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"
    - "taming numbers and durations in the model checking integrated planning system"
    - "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-8 (induced by source paper "modelling mixed discrete continuous domains for planning"):
  with members:
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"
    - "the power of modeling a response to pddl2 1"
    - "imperfect match pddl 2 1 and real applications"
    - "pddl2 1 the art of the possible commentary on fox and long"
    - "the case for durative actions a commentary on pddl2 1"

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)