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: "dispersion of mobile robots a study of memory time trade offs"
  Abstract: We introduce a new problem in the domain of mobile robots, which we term dispersion. In this problem, $n$ robots are placed in an $n$ node graph arbitrarily and must coordinate with each other to reach a final configuration such that exactly one robot is at each node. We study this problem through the lenses of minimizing the memory required by each robot and of minimizing the number of rounds required to achieve dispersion. #R##N#Dispersion is of interest due to its relationship to the problems of scattering on a graph, exploration using mobile robots, and load balancing on a graph. Additionally, dispersion has an immediate real world application due to its relationship to the problem of recharging electric cars, as each car can be considered a robot and recharging stations and the roads connecting them nodes and edges of a graph respectively. Since recharging is a costly affair relative to traveling, we want to distribute these cars amongst the various available recharge points where communication should be limited to car-to-car interactions. #R##N#We provide lower bounds on both the memory required for robots to achieve dispersion and the minimum running time to achieve dispersion on any type of graph. We then analyze the trade-offs between time and memory for various types of graphs. We provide time optimal and memory optimal algorithms for several types of graphs and show the power of a little memory in terms of running time.

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"
    - "a general lower bound for collaborative tree exploration"
    - "time and space optimality of rotor router graph exploration"
    - "algorithms for rapidly dispersing robot swarms in unknown environments"

Connected through hyperedge HE-2 (induced by source paper "dispersion of mobile robots the power of randomness"):
  with members:
    - "efficient dispersion of mobile robots on graphs"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-3 (induced by source paper "efficient dispersion of mobile robots on graphs"):
  with members:
    - "a general lower bound for collaborative tree exploration"
    - "deterministic graph exploration with advice"
    - "time and space optimality of rotor router graph exploration"
    - "algorithms for rapidly dispersing robot swarms in unknown environments"

Connected through hyperedge HE-4 (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"
    - "time and space optimality of rotor router graph exploration"
    - "algorithms for rapidly dispersing robot swarms in unknown environments"

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.DC(Distributed, Parallel, and Cluster Computing)