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 "the critical radius in sampling based motion planning"):
  Abstract: We develop a new analysis of sampling-based motion planning with uniform sampling, which significantly improves upon the celebrated result of Karaman and Frazzoli (2011) and subsequent work. Particularly, we prove the existence of a critical radius value proportional to $\Theta(n^{-1/d})$ for $n$ samples and $d$ dimensions: Below this value the planner is guaranteed to fail (similarly shown by the aforementioned work, ibid.). More importantly, for larger radius values the planner is asymptotically (near-)optimal (AO). A practical implication of our work is that AO is achieved when each sample is connected to only $\Theta(1)$ neighbors. This is in stark contrast to previous work which requires $O(\log n)$ connections, that are induced by a radius proportional to $\left(\frac{\log n}{n}\right)^{1/d}$. Our analysis is not restricted to PRM and is applicable to a variety of :PRM-based" planners, such as RRG, FMT* and BTT. Continuum percolation theory plays an important role in our proofs.

Includes members:
  Member "drrt scalable and informed asymptotically optimal multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sample complexity of probabilistic roadmaps via e nets")
  Member "probabilistic completeness of rrt for geometric and kinodynamic planning with forward propagation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "refined analysis of asymptotically optimal kinodynamic planning in the state cost space")
  Member "safe motion planning in unknown environments optimality benchmarks and tractable policies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "autonomous navigation in unknown environments using sparse kernel based occupancy mapping")
  Member "scalable asymptotically optimal multi robot motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "minimizing task space frechet error via efficient incremental graph search":
    also connected through other hyperedges:
      (none)
  Member "new perspective on sampling based motion planning via random geometric graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sample complexity of probabilistic roadmaps via e nets")
  Member "collision detection or nearest neighbor search on the computational bottleneck in sampling based motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "adaptively informed trees ait fast asymptotically optimal path planning through adaptive heuristics")
  Member "deterministic sampling based motion planning optimality complexity and performance":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "adaptively informed trees ait fast asymptotically optimal path planning through adaptive heuristics")

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)