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 3rd international planning competition results and analysis"):
  Abstract: This paper reports the outcome of the third in the series of biennial international planning competitions, held in association with the International Conference on AI Planning and Scheduling (AIPS) in 2002. In addition to describing the domains, the planners and the objectives of the competition, the paper includes analysis of the results. The results are analysed from several perspectives, in order to address the questions of comparative performance between planners, comparative difficulty of domains, the degree of agreement between planners about the relative difficulty of individual problem instances and the question of how well planners scale relative to one another over increasingly difficult problems. The paper addresses these questions through statistical analysis of the raw results of the competition, in order to determine which results can be considered to be adequately supported by the data. The paper concludes with a discussion of some challenges for the future of the competition series.

Includes members:
  Member "sapa a multi objective metric temporal planner":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interactive plan explicability in human robot teaming")
  Member "taming numbers and durations in the model checking integrated planning system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "vhpop versatile heuristic partial order planner":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning and tuning meta heuristics in plan space planning")
  Member "the metric ff planning system translating ignoring delete lists to numeric state variables":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")
  Member "planning through stochastic local search and temporal action graphs in lpg":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automated algorithm selection survey and perspectives")
  Member "a critical assessment of benchmark comparison in planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pitfalls and best practices in algorithm configuration")
  Member "the ff planning system fast plan generation through heuristic search":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "what should i do now marrying reinforcement learning and symbolic planning")

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)