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: "efficient multi robot motion planning for unlabeled discs in simple polygons"
  Abstract: We consider the following motion-planning problem: we are given $m$ unit discs in a simple polygon with $n$ vertices, each at their own start position, and we want to move the discs to a given set of $m$ target positions. Contrary to the standard (labeled) version of the problem, each disc is allowed to be moved to any target position, as long as in the end every target position is occupied. We show that this unlabeled version of the problem can be solved in $O(mn+m^2)$ time, assuming that the start and target positions are at least some minimal distance from each other. This is in sharp contrast to the standard (labeled) and more general multi-robot motion planning problem for discs moving in a simple polygon, which is known to be strongly NP-hard.

Connected through hyperedge HE-1 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning"):
  with members:
    - "scalable asymptotically optimal multi robot motion planning"
    - "effective metrics for multi robot motion planning"
    - "batch informed trees bit sampling based optimal planning via the heuristically guided search of implicit random geometric graphs"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "optimal sampling based motion planning under differential constraints the drift case with linear affine dynamics"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"
    - "k color multi robot motion planning"

Connected through hyperedge HE-2 (induced by source paper "complexity of planning"):
  with members:
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "on the hardness of unlabeled multi robot motion planning"

Connected through hyperedge HE-3 (induced by source paper "ddm fast near optimal multi robot path planning using diversified path and optimal sub problem solution database heuristics"):
  with members:
    - "multi agent pathfinding definitions variants and benchmarks"
    - "priority inheritance with backtracking for iterative multi agent path finding"
    - "automatic algorithm selection in multi agent pathfinding"
    - "coordinating the motion of labeled discs with optimality guarantees under extreme density"
    - "x anytime multiagent planning with bounded search"
    - "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "learning the problem optimum map analysis and application to global optimization in robotics"

Connected through hyperedge HE-4 (induced by source paper "independent set reconfiguration thresholds of hereditary graph classes"):
  with members:
    - "reconfiguration on sparse graphs"
    - "reconfiguring independent sets in claw free graphs"
    - "reconfiguration in bounded bandwidth and treedepth"
    - "linear time algorithm for sliding tokens on trees"
    - "on the parameterized complexity of reconfiguration problems"
    - "the complexity of change"
    - "kernel bounds for path and cycle problems"
    - "fast mixing of parallel glauber dynamics and low delay csma scheduling"

Connected through hyperedge HE-5 (induced by source paper "fast high quality dual arm rearrangement in synchronous monotone tabletop setups"):
  with members:
    - "coordinating the motion of labeled discs with optimality guarantees under extreme density"
    - "scalable asymptotically optimal multi robot motion planning"
    - "complexity results and fast methods for optimal tabletop rearrangement with overhand grasps"
    - "characterizing minimum length coordinated motions for two discs"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "asymptotically optimal algorithms for one to one pickup and delivery problems with applications to transportation systems"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"

Connected through hyperedge HE-6 (induced by source paper "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch"):
  with members:
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"
    - "minimizing movement fixed parameter tractability"
    - "k color multi robot motion planning"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"
    - "coin moving puzzles"

Connected through hyperedge HE-7 (induced by source paper "motion planning for multiple unit ball robots in mathbb r d"):
  with members:
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"

Connected through hyperedge HE-8 (induced by source paper "the critical radius in sampling based motion planning"):
  with members:
    - "drrt scalable and informed asymptotically optimal multi robot motion planning"
    - "probabilistic completeness of rrt for geometric and kinodynamic planning with forward propagation"
    - "safe motion planning in unknown environments optimality benchmarks and tractable policies"
    - "scalable asymptotically optimal multi robot motion planning"
    - "minimizing task space frechet error via efficient incremental graph search"
    - "new perspective on sampling based motion planning via random geometric graphs"
    - "collision detection or nearest neighbor search on the computational bottleneck in sampling based motion planning"
    - "deterministic sampling based motion planning optimality complexity and performance"

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)