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 "fault induced dynamics of oblivious robots on a line"):
  Abstract: The study of computing in presence of faulty robots in the Look-Compute-Move model has been the object of extensive investigation, typically with the goal of designing algorithms tolerant to as many faults as possible. In this paper, we initiate a new line of investigation on the presence of faults, focusing on a rather different issue. We are interested in understanding the dynamics of a group of robots when they execute an algorithm designed for a fault-free environment, in presence of some undetectable crashed robots. We start this investigation focusing on the classic point-convergence algorithm by Ando et al. for robots with limited visibility, in a simple setting (which already presents serious challenges): the robots operate fully synchronously on a line, and at most two of them are faulty. Interestingly, and perhaps surprisingly, the presence of faults induces the robots to perform some form of scattering, rather than point-convergence. In fact, we discover that they arrange themselves inside the segment delimited by the two faults in interleaved sequences of equidistant robots. The structure that they form has a hierarchical nature: robots organize themselves in groups where a group of some level converges to an equidistant distribution only after all groups of lower levels have converged. This is the first study on the unintended dynamics of oblivious robots induced by the presence of faults.

Includes members:
  Member "come together multi agent geometric consensus gathering rendezvous clustering aggregation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi agent pathfinding definitions variants and benchmarks")
  Member "erratic extremism causes dynamic consensus a new model for one dimensional opinion dynamics":
    also connected through other hyperedges:
      (none)
  Member "plane formation by synchronous mobile robots in the three dimensional euclidean space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "coding theory for noiseless channels realized by anonymous oblivious mobile robots")
  Member "distributed computing by mobile robots uniform circle formation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "arbitrary pattern formation on infinite grid by asynchronous oblivious robots")
  Member "fault and byzantine tolerant self stabilizing mobile robots gathering feasibility study":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "distributed pattern formation with faulty robots")
  Member "distributed computing by mobile robots solving the uniform circle formation problem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asynchronous pattern formation the effects of a rigorous approach")
  Member "certified impossibility results for byzantine tolerant mobile robots":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "randomized gathering of asynchronous mobile robots")

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)