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: "stripstream integrating symbolic planners and blackbox samplers"
  Abstract: Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, and motion constraints involving robot configurations, object transforms, and robot trajectories. These constraints typically require specialized procedures to sample satisfying values. We extend the STRIPS planning language to support a generic, declarative specification for these procedures while treating their implementation as blackboxes. We provide several domain-independent algorithms that reduce STRIPStream problems to a sequence of finite-domain STRIPS planning problems. Additionally, we describe cost-sensitive planning within this framework. Finally, we evaluate our algorithms on three robotic task and motion planning domains.

Connected through hyperedge HE-1 (induced by source paper "transferable task execution from pixels through deep planning domain learning"):
  with members:
    - "representing robot task plans as robust logical dynamical systems"
    - "prospection interpretable plans from language by predicting the future"
    - "an intriguing failing of convolutional neural networks and the coordconv solution"
    - "neural task graphs generalizing to unseen tasks from a single video demonstration"
    - "peorl integrating symbolic planning and hierarchical reinforcement learning for robust decision making"
    - "one shot hierarchical imitation learning of compound visuomotor tasks"
    - "visual robot task planning"
    - "learning generalized reactive policies using deep neural networks"

Connected through hyperedge HE-2 (induced by source paper "online replanning in belief space for partially observable task and motion problems"):
  with members:
    - "deepim deep iterative matching for 6d pose estimation"
    - "representing robot task plans as robust logical dynamical systems"
    - "bounded policy synthesis for pomdps with safe reachability objectives"
    - "sampling based methods for factored task and motion planning"
    - "an anytime algorithm for task and motion mdps"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "posecnn a convolutional neural network for 6d object pose estimation in cluttered scenes"
    - "pddl2 1 an extension to pddl for expressing temporal planning domains"

Connected through hyperedge HE-3 (induced by source paper "anytime integrated task and motion policies for stochastic environments"):
  with members:
    - "sampling based methods for factored task and motion planning"
    - "active model learning and diverse action sampling for task and motion planning"
    - "an anytime algorithm for task and motion mdps"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "deep reinforcement learning in parameterized action space"

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)