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: "on the power of manifold samples in exploring configuration spaces and the dimensionality of narrow passages"
  Abstract: We extend our study of Motion Planning via Manifold Samples (MMS), a general algorithmic framework that combines geometric methods for the exact and complete analysis of low-dimensional configuration spaces with sampling-based approaches that are appropriate for higher dimensions. The framework explores the configuration space by taking samples that are entire low-dimensional manifolds of the configuration space capturing its connectivity much better than isolated point samples. The contributions of this paper are as follows: (i) We present a recursive application of MMS in a six-dimensional configuration space, enabling the coordination of two polygonal robots translating and rotating amidst polygonal obstacles. In the adduced experiments for the more demanding test cases MMS clearly outperforms PRM, with over 20-fold speedup in a coordination-tight setting. (ii) A probabilistic completeness proof for the most prevalent case, namely MMS with samples that are affine subspaces. (iii) A closer examination of the test cases reveals that MMS has, in comparison to standard sampling-based algorithms, a significant advantage in scenarios containing high-dimensional narrow passages. This provokes a novel characterization of narrow passages which attempts to capture their dimensionality, an attribute that had been (to a large extent) unattended in previous definitions.

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"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"

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"
    - "fast high quality dual arm rearrangement in synchronous monotone tabletop setups"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "effective metrics for multi robot motion planning"):
  with members:
    - "scalable asymptotically optimal multi robot motion planning"
    - "on the hardness of unlabeled multi robot motion planning"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "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"
    - "sampling based algorithms for optimal motion planning"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-4 (induced by source paper "motion planning for unlabeled discs with optimality guarantees"):
  with members:
    - "on the hardness of unlabeled multi robot motion planning"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "a linear time algorithm for the feasibility of pebble motion on graphs"
    - "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"
    - "distance optimal formation control on graphs with a tight convergence time guarantee"
    - "multi agent path planning and network flow"
    - "planning optimal paths for multiple robots on graphs"

Connected through hyperedge HE-5 (induced by source paper "on the hardness of unlabeled multi robot motion planning"):
  with members:
    - "motion planning for unlabeled discs with optimality guarantees"
    - "similar part rearrangement with pebble graphs"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "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"
    - "limits of rush hour logic complexity"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-6 (induced by source paper "efficient multi robot motion planning for unlabeled discs in simple polygons"):
  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"
    - "k color multi robot motion planning"
    - "distance optimal formation control on graphs with a tight convergence time guarantee"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"
    - "algorithms for rapidly dispersing robot swarms in unknown environments"

Connected through hyperedge HE-7 (induced by source paper "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"):
  with members:
    - "motion planning for unlabeled discs with optimality guarantees"
    - "on the hardness of unlabeled multi robot motion planning"
    - "efficient multi robot motion planning for unlabeled discs in simple polygons"
    - "k color multi robot motion planning"
    - "sampling based algorithms for optimal motion planning"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-8 (induced by source paper "motion planning via manifold samples"):
  with members:
    - "a generic lazy evaluation scheme for exact geometric computations"

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)