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: "decentralized connectivity preserving deployment of large scale robot swarms"
  Abstract: We present a decentralized and scalable approach for deployment of a robot swarm. Our approach tackles scenarios in which the swarm must reach multiple spatially distributed targets, and enforce the constraint that the robot network cannot be split. The basic idea behind our work is to construct a logical tree topology over the physical network formed by the robots. The logical tree acts as a backbone used by robots to enforce connectivity constraints. We study and compare two algorithms to form the logical tree: outwards and inwards. These algorithms differ in the order in which the robots join the tree: the outwards algorithm starts at the tree root and grows towards the targets, while the inwards algorithm proceeds in the opposite manner. Both algorithms perform periodic reconfiguration, to prevent suboptimal topologies from halting the growth of the tree. Our contributions are (i) The formulation of the two algorithms; (ii) A comparison of the algorithms in extensive physics-based simulations; (iii) A validation of our findings through real-robot experiments.

Connected through hyperedge HE-1 (induced by source paper "self healing ground and air connectivity chains"):
  with members:
    - "failure tolerant connectivity maintenance for robot swarms"
    - "decentralized collaborative transport of fabrics using micro uavs"
    - "distributed cohesive control for robot swarms maintaining good connectivity in the presence of exterior forces"
    - "distributed estimation and control of algebraic connectivity over random graphs"
    - "sampling based algorithms for optimal motion planning"

Connected through hyperedge HE-2 (induced by source paper "multi robot persistent surveillance with connectivity constraints"):
  with members:
    - "multi robot patrolling with sensing idleness and data delay objectives"
    - "persistent multi uav surveillance with data latency constraints"
    - "persistent robotic tasks monitoring and sweeping in changing environments"
    - "dynamic coverage of mobile sensor networks"

Connected through hyperedge HE-3 (induced by source paper "behavior mixing with minimum global and subgroup connectivity maintenance for large scale multi robot systems"):
  with members:
    - "control barrier functions theory and applications"
    - "a time and message optimal distributed algorithm for minimum spanning trees"
    - "multi objective compositions for collision free connectivity maintenance in teams of mobile robots"
    - "distributed verification and hardness of distributed approximation"

Connected through hyperedge HE-4 (induced by source paper "fast multipole networks"):
  with members:
    - "wireless resilient routing reconfiguration"
    - "distributed cohesive control for robot swarms maintaining good connectivity in the presence of exterior forces"
    - "petascale turbulence simulation using a highly parallel fast multipole method on gpus"
    - "a tuned and scalable fast multipole method as a preeminent algorithm for exascale systems"

Connected through hyperedge HE-5 (induced by source paper "failure tolerant connectivity maintenance for robot swarms"):
  with members:
    - "stop think and roll online gain optimization for resilient multi robot topologies"
    - "distributed cohesive control for robot swarms maintaining good connectivity in the presence of exterior forces"

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)