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: "control of magnetic microrobot teams for temporal micromanipulation tasks"
  Abstract: In this paper, we present a control framework that allows magnetic microrobot teams to accomplish complex micromanipulation tasks captured by global Linear Temporal Logic (LTL) formulas. To address this problem, we propose an optimal control synthesis method that constructs discrete plans for the robots that satisfy both the assigned tasks as well as proximity constraints between the robots due to the physics of the problem. Our proposed algorithm relies on an existing optimal control synthesis approach combined with a novel technique to reduce the state-space of the product automaton that is associated with the LTL specifications. The synthesized discrete plans are executed by the microrobots independently using local magnetic fields. Simulation studies show that the proposed algorithm can address large-scale planning problems that cannot be solved using existing optimal control synthesis approaches. Moreover, we present experimental results that also illustrate the potential of our method in practice. To the best of our knowledge, this is the first control framework that allows independent control of teams of magnetic microrobots for temporal micromanipulation tasks.

Connected through hyperedge HE-1 (induced by source paper "an abstraction free method for multi robot temporal logic optimal control synthesis"):
  with members:
    - "stylus a temporal logic optimal control synthesis algorithm for large scale multi robot systems"
    - "learning sampling distributions for robot motion planning"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "sampling based temporal logic path planning"
    - "optimal multi robot path planning with ltl constraints guaranteeing correctness through synchronization"
    - "sampling based algorithms for optimal motion planning"
    - "synthesis of distributed control and communication schemes from global ltl specifications"
    - "linear encodings of bounded ltl model checking"

Connected through hyperedge HE-2 (induced by source paper "stylus a temporal logic optimal control synthesis algorithm for large scale multi robot systems"):
  with members:
    - "probabilistically safe corridors to guide sampling based motion planning"
    - "monte carlo tree search for efficient visually guided rearrangement planning"
    - "t a heuristic search based algorithm for motion planning with temporal goals"
    - "learning sampling distributions for robot motion planning"
    - "decentralized abstractions for multi agent systems under coupled constraints"
    - "sampling based temporal logic path planning"
    - "optimal multi robot path planning with ltl constraints guaranteeing correctness through synchronization"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-3 (induced by source paper "multirobot coordination with counting temporal logics"):
  with members:
    - "census signal temporal logic inference for multiagent group behavior analysis"
    - "control synthesis for permutation symmetric high dimensional systems with counting constraints"
    - "the robotarium a remotely accessible swarm robotics research testbed"
    - "robust multi robot optimal path planning with temporal logic constraints"
    - "linear encodings of bounded ltl model checking"

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)