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: "algorithms for rapidly dispersing robot swarms in unknown environments"
  Abstract: We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels that form a connected subset of the integer grid. #R##N#There is at most one robot per pixel and robots move horizontally or vertically at unit speed. Robots enter R by means of k>=1 door pixels #R##N#Robots are primitive finite automata, only having local communication, local sensors, and a constant-sized memory. #R##N#We first give algorithms for the single-door case (i.e., k=1), analyzing the algorithms both theoretically and experimentally. We prove that our algorithms have optimal makespan 2A-1, where A is the area of R. #R##N#We next give an algorithm for the multi-door case (k>1), based on a wall-following version of the leader-follower strategy. We prove that our strategy is O(log(k+1))-competitive, and that this bound is tight for our strategy and other related strategies.

Connected through hyperedge HE-1 (induced by source paper "dispersion of mobile robots in the global communication model"):
  with members:
    - "dispersion of mobile robots the power of randomness"
    - "efficient dispersion of mobile robots on graphs"
    - "efficient dispersion of mobile robots on arbitrary graphs and grids"
    - "dispersion of mobile robots a study of memory time trade offs"
    - "a general lower bound for collaborative tree exploration"
    - "time and space optimality of rotor router graph exploration"

Connected through hyperedge HE-2 (induced by source paper "fast and reliable dispersal of crash prone agents on graphs"):
  with members:
    - "probabilistic pursuits on graphs"
    - "minimizing travel in the uniform dispersal problem for robotic sensors"
    - "efficient dispersion of mobile robots on graphs"

Connected through hyperedge HE-3 (induced by source paper "asynchronous filling by luminous robots"):
  with members:
    - "minimizing travel in the uniform dispersal problem for robotic sensors"

Connected through hyperedge HE-4 (induced by source paper "minimizing travel in the uniform dispersal problem for robotic sensors"):
  with members:
    - "minimizing movement fixed parameter tractability"

Connected through hyperedge HE-5 (induced by source paper "efficient dispersion of mobile robots on graphs"):
  with members:
    - "dispersion of mobile robots a study of memory time trade offs"
    - "a general lower bound for collaborative tree exploration"
    - "deterministic graph exploration with advice"
    - "time and space optimality of rotor router graph exploration"

Connected through hyperedge HE-6 (induced by source paper "efficient dispersion of mobile robots on arbitrary graphs and grids"):
  with members:
    - "dispersion of mobile robots the power of randomness"
    - "efficient dispersion of mobile robots on graphs"
    - "dispersion of mobile robots a study of memory time trade offs"
    - "time and space optimality of rotor router graph exploration"

Connected through hyperedge HE-7 (induced by source paper "improved leader election for self organizing programmable matter"):
  with members:
    - "on the runtime of universal coating for programmable matter"
    - "a markov chain algorithm for compression in self organizing particle systems"
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "leader election and shape formation with self organizing programmable matter"
    - "parallel computation using active self assembly"
    - "fast algorithmic self assembly of simple shapes using random agitation"
    - "active self assembly of algorithmic shapes and patterns in polylogarithmic time"
    - "intrinsic universality and the computational power of self assembly"

Connected through hyperedge HE-8 (induced by source paper "universal coating for programmable matter"):
  with members:
    - "an algorithmic framework for shape formation problems in self organizing particle systems"
    - "leader election and shape formation with self organizing programmable matter"
    - "simple and efficient local codes for distributed stable network construction"
    - "intrinsic universality and the computational power of self assembly"
    - "physarum can compute shortest paths"

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)