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

Connected through hyperedge HE-1 (induced by source paper "synthesizing action sequences for modifying model decisions"):
  with members:
    - "houdini lifelong learning as program synthesis"
    - "interpreting neural network judgments via minimal stable and symbolic corrections"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "axiomatic attribution for deep networks"
    - "counterfactual explanations without opening the black box automated decisions and the gdpr"
    - "scalable planning with tensorflow for hybrid nonlinear domains"
    - "a unified approach to interpreting model predictions"
    - "practical black box attacks against machine learning"

Connected through hyperedge HE-2 (induced by source paper "timeline based planning and execution with uncertainty theory modeling methodologies and practice"):
  with members:
    - "hatp an htn planner for robotics"
    - "the lama planner guiding cost based anytime planning with landmarks"
    - "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-3 (induced by source paper "casp solutions for planning in hybrid domains"):
  with members:
    - "planning and scheduling in hybrid domains using answer set programming"
    - "asp modulo csp the clingcon system"
    - "plan based policies for efficient multiple battery load management"
    - "modelling mixed discrete continuous domains for planning"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-4 (induced by source paper "a hybrid lp rpg heuristic for modelling numeric resource flows in planning"):
  with members:
    - "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"
    - "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-5 (induced by source paper "probabilistic planning for continuous dynamic systems under bounded risk"):
  with members:
    - "dynamic programming for structured continuous markov decision problems"
    - "modelling mixed discrete continuous domains for planning"
    - "risk sensitive reinforcement learning applied to control under constraints"

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)