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 "a certified complete bimanual manipulation planner"):
  Abstract: Planning motions for two robot arms to move an object collaboratively is a difficult problem, mainly because of the closed-chain constraint, which arises whenever two robot hands simultaneously grasp a single rigid object. In this paper, we propose a manipulation planning algorithm to bring an object from an initial stable placement (position and orientation of the object on the support surface) towards a goal stable placement. The key specificity of our algorithm is that it is certified-complete: for a given object and a given environment, we provide a certificate that the algorithm will find a solution to any bimanual manipulation query in that environment whenever one exists. Moreover, the certificate is constructive: at run-time, it can be used to quickly find a solution to a given query. The algorithm is tested in software and hardware on a number of large pieces of furniture.

Includes members:
  Member "closed chain manipulation of large objects by multi arm robotic systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dual arm in hand manipulation and regrasping using dexterous manipulation graphs")
  Member "developing and comparing single arm and dual arm regrasp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "autonomous bimanual functional regrasping of novel object class instances")
  Member "completeness of randomized kinodynamic planners with state based steering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rrt2 0 for fast and optimal kinodynamic sampling based motion planning")
  Member "analyzing the utility of a support pin in sequential robotic manipulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reorienting objects in 3d space using pivoting")
  Member "a single query manipulation planner":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "closed chain manipulation of large objects by multi arm robotic systems")
  Member "a general fast and robust implementation of the time optimal path parameterization algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "gomp grasp optimized motion planning for bin picking")
  Member "sampling based algorithms for optimal motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "3d dynamic scene graphs actionable spatial perception with places objects and humans")

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