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 "finding a needle in an exponential haystack discrete rrt for exploration of implicit roadmaps in multi robot motion planning"):
  Abstract: We present a sampling-based framework for multi-robot motion planning which combines an implicit representation of a roadmap with a novel approach for pathfinding in geometrically embedded graphs tailored for our setting. Our pathfinding algorithm, discrete-RRT (dRRT), is an adaptation of the celebrated RRT algorithm for the discrete case of a graph, and it enables a rapid exploration of the high-dimensional configuration space by carefully walking through an implicit representation of a tensor product of roadmaps for the individual robots. We demonstrate our approach experimentally on scenarios of up to 60 degrees of freedom where our algorithm is faster by a factor of at least ten when compared to existing algorithms that we are aware of.

Includes members:
  Member "motion planning for unlabeled discs with optimality guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "k color 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 "on the power of manifold samples in exploring configuration spaces and the dimensionality of narrow passages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "drrt scalable and informed asymptotically optimal multi robot motion planning")
  Member "sampling based algorithms for optimal motion planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "3d dynamic scene graphs actionable spatial perception with places objects and humans")
  Member "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the computational complexity of fire emblem series and similar tactical role playing games")

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)