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: "pebble motion on graphs with rotations efficient feasibility tests and planning algorithms"
  Abstract: We study the problem of planning paths for $p$ distinguishable pebbles (robots) residing on the vertices of an $n$-vertex connected graph with $p \le n$. A pebble may move from a vertex to an adjacent one in a time step provided that it does not collide with other pebbles. When $p = n$, the only collision free moves are synchronous rotations of pebbles on disjoint cycles of the graph. We show that the feasibility of such problems is intrinsically determined by the diameter of a (unique) permutation group induced by the underlying graph. Roughly speaking, the diameter of a group $\mathbf G$ is the minimum length of the generator product required to reach an arbitrary element of $\mathbf G$ from the identity element. Through bounding the diameter of this associated permutation group, which assumes a maximum value of $O(n^2)$, we establish a linear time algorithm for deciding the feasibility of such problems and an $O(n^3)$ algorithm for planning complete paths.

Connected through hyperedge HE-1 (induced by source paper "efficient multi agent motion planning in continuous workspaces using medial axis based swap graphs"):
  with members:
    - "the starcraft multi agent challenge"
    - "sear a polynomial time multi robot path planning algorithm with expected constant factor optimality guarantee"
    - "average case constant factor time and distance optimal multi robot path planning in well connected environments"
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "motion planning for unlabeled discs with optimality guarantees"
    - "optimal multi robot path planning on graphs structure and computational complexity"

Connected through hyperedge HE-2 (induced by source paper "multi robot path planning via genetic programming"):
  with members:
    - "coordinating the motion of labeled discs with optimality guarantees under extreme density"
    - "sear a polynomial time multi robot path planning algorithm with expected constant factor optimality guarantee"
    - "multi agent path finding with deadlines"
    - "mapp a scalable multi agent path planning algorithm with tractability and completeness guarantees"

Connected through hyperedge HE-3 (induced by source paper "average case constant factor time and distance optimal multi robot path planning in well connected environments"):
  with members:
    - "lifelong multi agent path finding for online pickup and delivery tasks"
    - "sear a polynomial time expected constant factor optimal algorithmic framework for multi robot path planning"
    - "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"
    - "a linear time algorithm for the feasibility of pebble motion on graphs"
    - "k color multi robot motion planning"
    - "distance optimal formation control on graphs with a tight convergence time guarantee"

Connected through hyperedge HE-4 (induced by source paper "optimal target assignment and path finding for teams of agents"):
  with members:
    - "multi agent path planning and network flow"
    - "planning optimal paths for multiple robots on graphs"

Connected through hyperedge HE-5 (induced by source paper "an effective algorithmic framework for near optimal multi robot path planning"):
  with members:
    - "motion planning for unlabeled discs with optimality guarantees"
    - "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"
    - "planning optimal paths for multiple robots on graphs"
    - "exploiting subgraph structure in multi robot path planning"

Connected through hyperedge HE-6 (induced by source paper "planning optimal paths for multiple robots on graphs"):
  with members:
    - "distance optimal formation control on graphs with a tight convergence time guarantee"
    - "multi agent path planning and network flow"
    - "diameters of permutation groups on graphs and linear time feasibility test of pebble motion problems"
    - "exploiting subgraph structure in multi robot path planning"

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.DS(Data Structures and Algorithms)