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: "fast high quality dual arm rearrangement in synchronous monotone tabletop setups"
  Abstract: Rearranging objects on a planar surface arises in a variety of robotic applications, such as product packaging. Using two arms can improve efficiency but introduces new computational challenges. This paper studies the structure of dual-arm rearrangement for synchronous, monotone tabletop setups and develops an optimal mixed integer model. It then describes an efficient and scalable algorithm, which first minimizes the cost of object transfers and then of moves between objects. This is motivated by the fact that, asymptotically, object transfers dominate the cost of solutions. Moreover, a lazy strategy minimizes the number of motion planning calls and results in significant speedups. Theoretical arguments support the benefits of using two arms and indicate that synchronous execution, in which the two arms perform together either transfers or moves, introduces only a small overhead. Experiments support these points and show that the scalable method can quickly compute solutions close to the optimal for the considered setup.

Connected through hyperedge HE-1 (induced by source paper "on rearrangement of items stored in stacks"):
  with members:
    - "efficient high quality stack rearrangement"
    - "complexity results and fast methods for optimal tabletop rearrangement with overhand grasps"
    - "on the hardness of unlabeled multi robot motion planning"
    - "pushpush and push 1 are np hard in 2d"

Connected through hyperedge HE-2 (induced by source paper "anytime multi arm task and motion planning for pick and place of individual objects via handoffs"):
  with members:
    - "drrt scalable and informed asymptotically optimal multi robot motion planning"
    - "towards robust product packing with a minimalistic end effector"
    - "admissible abstractions for near optimal task and motion planning"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "scalable asymptotically optimal multi robot motion planning"
    - "analysis and observations from the first amazon picking challenge"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"
    - "on the power of manifold samples in exploring configuration spaces and the dimensionality of narrow passages"

Connected through hyperedge HE-3 (induced by source paper "pushing the boundaries of asymptotic optimality for sampling based roadmaps in motion and task planning"):
  with members:
    - "admissible abstractions for near optimal task and motion planning"
    - "ffrob leveraging symbolic planning for efficient task and motion planning"
    - "the critical radius in sampling based motion planning"
    - "new perspective on sampling based motion planning via random geometric graphs"
    - "deterministic sampling based motion planning optimality complexity and performance"
    - "sampling based algorithms for optimal motion planning"

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)