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: "sear a polynomial time expected constant factor optimal algorithmic framework for multi robot path planning"
  Abstract: This work studies the labeled multi-robot path and motion planning problem in continuous domains, in the absence of static obstacles. Given $n$ robots which may be arbitrarily close to each other and assuming random start and goal configurations for the robots, we derived an $O(n^3)$, complete algorithm that produces solutions with constant-factor optimality guarantees on both makespan and distance optimality, in expectation. Furthermore, our algorithm only requires a small constant factor expansion of the initial and goal configuration footprints for solving the problem. In addition to strong theoretical guarantees, we present a thorough computational evaluation of the proposed solution. Beyond the baseline solution, adapting an effective (but non-polynomial time) robot routing subroutine, we also provide a highly efficient implementation that quickly computes near-optimal solutions. Hardware experiments on microMVP platform composed of non-holonomic robots confirms the practical applicability of our algorithmic pipeline.

Connected through hyperedge HE-1 (induced by source paper "constant factor time optimal multi robot routing on high dimensional grids in mostly sub quadratic time"):
  with members:
    - "coordinated motion planning reconfiguring a swarm of labeled robots with bounded stretch"
    - "average case constant factor time and distance optimal multi robot path planning in well connected environments"
    - "on the hardness of unlabeled multi robot motion planning"
    - "k color multi robot motion planning"
    - "pspace completeness of sliding block puzzles and other problems through the nondeterministic constraint logic model of computation"

Connected through hyperedge HE-2 (induced by source paper "coordinating the motion of labeled discs with optimality guarantees under extreme density"):
  with members:
    - "on the hardness of unlabeled multi robot motion planning"
    - "k color multi robot motion planning"

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"
    - "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"
    - "multi agent path planning and network flow"

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.MA(Multiagent Systems)