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 "colin planning with continuous linear numeric change"):
  Abstract: In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of reasoning with COntinuous LINear numeric change, in addition to the full temporal semantics of PDDL2.1. Through this work we make two advances to the state-of-the-art in terms of expressive reasoning capabilities of planners: the handling of continuous linear change, and the handling of duration-dependent effects in combination with duration inequalities, both of which require tightly coupled temporal and numeric reasoning during planning. COLIN combines FF-style forward chaining search, with the use of a Linear Program (LP) to check the consistency of the interacting temporal and numeric constraints at each state. The LP is used to compute bounds on the values of variables in each state, reducing the range of actions that need to be considered for application. In addition, we develop an extension of the Temporal Relaxed Planning Graph heuristic of CRIKEY3, to support reasoning directly with continuous change. We extend the range of task variables considered to be suitable candidates for specifying the gradient of the continuous numeric change effected by an action. Finally, we explore the potential for employing mixed integer programming as a tool for optimising the timestamps of the actions in the plan, once a solution has been found. To support this, we further contribute a selection of extended benchmark domains that include continuous numeric effects. We present results for COLIN that demonstrate its scalability on a range of benchmarks, and compare to existing state-of-the-art planners.

Includes members:
  Member "the lama planner guiding cost based anytime planning with landmarks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning domain independent planning heuristics with hypergraph networks")
  Member "compiling uncertainty away in conformant planning problems with bounded width":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "memory bounded open loop planning in large pomdps using thompson sampling")
  Member "a heuristic search approach to planning with continuous resources in stochastic domains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "bounded approximate symbolic dynamic programming for hybrid mdps")
  Member "modelling mixed discrete continuous domains for planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "timeline based planning expressiveness and complexity")
  Member "the fast downward planning system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transferable task execution from pixels through deep planning domain learning")
  Member "an approach to temporal planning and scheduling in domains with predictable exogenous events":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards explainable ai planning as a service")
  Member "the deterministic part of ipc 4 an overview":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "handling pddl3 0 state trajectory constraints with temporal landmarks")
  Member "sapa a multi objective metric temporal planner":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interactive plan explicability in human robot teaming")

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)