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

Includes members:
  Member "coordinating the motion of labeled discs with optimality guarantees under extreme density":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics")
  Member "scalable asymptotically optimal multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "complexity results and fast methods for optimal tabletop rearrangement with overhand grasps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scalable and probabilistically complete planning for robotic spatial extrusion")
  Member "characterizing minimum length coordinated motions for two discs":
    also connected through other hyperedges:
      (none)
  Member "motion planning for unlabeled discs with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "on the hardness of unlabeled multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "efficient multi robot motion planning for unlabeled discs in simple polygons":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "asymptotically optimal algorithms for one to one pickup and delivery problems with applications to transportation systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "toward fast and optimal robotic pick and place on a moving conveyor")

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)