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 "randomized gathering of asynchronous mobile robots"):
  Abstract: This paper revisits the widely researched \textit{gathering} problem for two robots in a scenario which allows randomization in the asynchronous scheduling model. The scheduler is considered to be the adversary which determines the activation schedule of the robots. The adversary comes in two flavors, namely, oblivious and adaptive, based on the knowledge of the outcome of random bits. The robots follow \textit{wait-look-compute-move} cycle. #R##N#In this paper, we classify the problems based on the capability of the adversary to control the parameters such as wait time, computation delay and the speed of robots and check the feasibility of gathering in terms of adversarial knowledge and capabilities. The main contributions include the possibility of gathering for an oblivious adversary with (i) zero computation delay; (ii) the sum of wait time and computation delay is more than a positive value. We complement the possibilities with an impossibility. #R##N#We show that it is impossible for the robots to gather against an adaptive adversary with non-negative wait time and non-negative computation delay. Finally, we also extend our algorithm for multiple robots with merging.

Includes members:
  Member "optimal rendezvous mathcal l algorithms for asynchronous mobile robots with external lights":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "optimally gathering two robots":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using model checking to formally verify rendezvous algorithms for robots with lights in euclidean space")
  Member "the random bit complexity of mobile robots scattering":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "fault induced dynamics of oblivious robots on a line")

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)