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: "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch"
  Abstract: We present a number of breakthroughs for coordinated motion planning, in which the objective is to reconfigure a swarm of labeled convex objects by a combination of parallel, continuous, collision-free translations into a given target arrangement. Problems of this type can be traced back to the classic work of Schwartz and Sharir (1983), who gave a method for deciding the existence of a coordinated motion for a set of disks between obstacles; their approach is polynomial in the complexity of the obstacles, but exponential in the number of disks. Other previous work has largely focused on {\em sequential} schedules, in which one robot moves at a time. #R##N#We provide constant-factor approximation algorithms for minimizing the execution time of a coordinated, {\em parallel} motion plan for a swarm of robots in the absence of obstacles, provided some amount of separability. #R##N#Our algorithm achieves {\em constant stretch factor}: If all robots are at most $d$ units from their respective starting positions, the total duration of the overall schedule is $O(d)$. Extensions include unlabeled robots and different classes of robots. We also prove that finding a plan with minimal execution time is NP-hard, even for a grid arrangement without any stationary obstacles. On the other hand, we show that for densely packed disks that cannot be well separated, a stretch factor $\Omega(N^{1/4})$ may be required. On the positive side, we establish a stretch factor of $O(N^{1/2})$ even in this case.

Connected through hyperedge HE-1 (induced by source paper "the parameterized complexity of motion planning for snake like robots"):
  with members:
    - "towards tight er bounds for the excluded grid theorem"
    - "push pull block puzzles are hard"
    - "how to navigate through obstacles"
    - "a survey of motion planning and control techniques for self driving urban vehicles"
    - "polynomial bounds for the grid minor theorem"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-2 (induced by source paper "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time"):
  with members:
    - "average case constant factor time and distance optimal multi robot path planning in well connected environments"
    - "sear a polynomial time expected constant factor optimal algorithmic framework for multi robot path planning"
    - "on the hardness of unlabeled multi robot motion planning"
    - "k color multi robot motion planning"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-3 (induced by source paper "tilt assembly algorithms for micro factories that build objects with uniform external forces"):
  with members:
    - "collecting a swarm in a grid environment using shared global inputs"
    - "universal coating for programmable matter"
    - "optimal staged self assembly of general shapes"
    - "new geometric algorithms for fully connected staged self assembly"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "particle computation designing worlds to control robot swarms with only global signals"
    - "crowdsourcing swarm manipulation experiments a massive online user study with large swarms of simple robots"
    - "two hands are better than one up to constant factors"

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.CG(Computational Geometry)