human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "asynchronous filling by luminous robots"):
  Abstract: In this work we investigate this problem in the asynchronous model by luminous robots. In this model a light is attached to the robots, which serves as externally visible bits stored in that light encoded by a color. First, we present an algorithm solving the asynchronous Filling problem with robots having $1$ hop visibility range, $O(\log\Delta)$ bits of persistent storage, and $\Delta+3$ colors, where $\Delta$ is the maximum degree of the graph. Then we show, how the number of colors can be reduced to $O(1)$ at the cost of the running time. After this we show, how the running time can be improved by robots with visibility range of $2$ hops, $O(\log \Delta)$ bits of persistent memory, and $\Delta + 3$ colors. We show, that in the fully synchronous case, the running time of this algorithm is $O(n)$. We show how to extend our asynchronous solution to the $k$-Door case, $k\geq 2$, by using $\Delta + k + 3$ colors. Finally, we present simulation results.

Includes members:
  Member "minimizing travel in the uniform dispersal problem for robotic sensors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fast and reliable dispersal of crash prone agents on graphs")
  Member "algorithms for rapidly dispersing robot swarms in unknown environments":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dispersion of mobile robots in the global communication model")

Question: Please tell me which class the source paper 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)