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

Includes members:
  Member "supply restoration in power distribution systems a case study in integrating model based diagnosis and repair planning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "engineering benchmarks for planning the domains used in the deterministic part of ipc 4")
  Member "engineering benchmarks for planning the domains used in the deterministic part of ipc 4":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "structure and problem hardness goal asymmetry and dpll proofs in sat based planning")
  Member "where ignoring delete lists works local search topology in planning benchmarks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to rank for synthesizing planning heuristics")
  Member "taming numbers and durations in the model checking integrated planning system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a hybrid lp rpg heuristic for modelling numeric resource flows in planning")
  Member "pddl2 1 an extension to pddl for expressing temporal planning domains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "automated algorithm selection survey and perspectives")

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)