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: "online interactive user guidance for high dimensional constrained motion planning"
  Abstract: We consider the problem of planning a collision-free path for a high-dimensional robot. Specifically, we suggest a planning framework where a motion-planning algorithm can obtain guidance from a user. In contrast to existing approaches, we suggest to seek user guidance only when the planner identifies that it ceases to make significant progress towards the goal. User guidance is given in the form of an intermediate configuration $\hat{q}$ which, in turn, is used to bias the planner to go through $\hat{q}$. We demonstrate our approach for the case where the planning algorithm is Multi-Heuristic A* (MHA*) and the robot is a 34-DOF humanoid. We show that using this general approach allows to compute highly-constrained paths such as climbing stairs with little domain knowledge. Without our approach, solving such problems require carefully-crafted domain-dependent heuristics.

Connected through hyperedge HE-1 (induced by source paper "toward asymptotically optimal inspection planning via efficient near optimal graph search"):
  with members:
    - "generalized lazy search for robot motion planning interleaving search and edge evaluation via event based toggles"
    - "lazy receding horizon a for efficient path planning in graphs with expensive to evaluate edges"
    - "group marching tree sampling based approximately optimal motion planning on gpus"
    - "efficient motion planning for problems lacking optimal substructure"
    - "the provable virtue of laziness in motion planning"
    - "effective footstep planning for humanoids using homotopy class guidance"
    - "new perspective on sampling based motion planning via random geometric graphs"
    - "a unifying formalism for shortest path problems with expensive edge evaluations via lazy best first search over paths with edge selectors"

Connected through hyperedge HE-2 (induced by source paper "non prehensile manipulation in clutter with human in the loop"):
  with members:
    - "efficient obstacle rearrangement for object manipulation tasks in cluttered environments"
    - "planning for target retrieval using a robotic manipulator in cluttered and occluded environments"
    - "planning with a receding horizon for manipulation in clutter using a learned value function"
    - "real time online re planning for grasping under clutter and uncertainty"
    - "randomized physics based motion planning for grasping in cluttered and uncertain environments"

Connected through hyperedge HE-3 (induced by source paper "effective footstep planning for humanoids using homotopy class guidance"):
  with members:
    - "learning heuristic search via imitation"

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.RO(Robotics)