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: "efficient dispersion of mobile robots on graphs"
  Abstract: The dispersion problem on graphs requires $k$ robots placed arbitrarily at the $n$ nodes of an anonymous graph, where $k \leq n$, to coordinate with each other to reach a final configuration in which each robot is at a distinct node of the graph. The dispersion problem is important due to its relationship to graph exploration by mobile robots, scattering on a graph, and load balancing on a graph. In addition, an intrinsic application of dispersion has been shown to be the relocation of self-driven electric cars (robots) to recharge stations (nodes). We propose three efficient algorithms to solve dispersion on graphs. Our algorithms require $O(k \log \Delta)$ bits at each robot, and $O(m)$ steps running time, where $m$ is the number of edges and $\Delta$ is the degree of the graph. The algorithms differ in whether they address the synchronous or the asynchronous system model, and in what, where, and how data structures are maintained.

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 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"
    - "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:
    - "dispersion of mobile robots a study of memory time trade offs"
    - "optimal grid exploration by asynchronous oblivious robots"
    - "optimal deterministic ring exploration with oblivious asynchronous robots"

Connected through hyperedge HE-3 (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"
    - "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"
    - "dispersion of mobile robots a study of memory time trade offs"
    - "time and space optimality of rotor router graph exploration"
    - "algorithms for rapidly dispersing robot swarms in unknown environments"

Connected through hyperedge HE-5 (induced by source paper "dispersion of mobile robots a study of memory time trade offs"):
  with members:
    - "deterministic dispersion of mobile robots in dynamic rings"
    - "a general lower bound for collaborative tree exploration"
    - "on the power of one bit how to explore a graph when you cannot backtrack"
    - "tight bounds for randomized load balancing on arbitrary network topologies"

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)