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 "self stabilizing robots in highly dynamic environments"):
  Abstract: This paper deals with the classical problem of exploring a ring by a cohort of synchronous robots. We focus on the perpetual version of this problem in which it is required that each node of the ring is visited by a robot infinitely often. The challenge in this paper is twofold. First, we assume that the robots evolve in a highly dynamic ring, i.e., edges may appear and disappear unpredictably without any recurrence nor periodicity assumption. The only assumption we made is that each node is infinitely often reachable from any other node. Second, we aim at providing a self-stabilizing algorithm to the robots, i.e., the algorithm must guarantee an eventual correct behavior regardless of the initial state and positions of the robots. Our main contribution is to show that this problem is deterministically solvable in this harsh environment by providing a self-stabilizing algorithm for three robots.

Includes members:
  Member "gathering in dynamic rings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "live exploration with mobile robots in a dynamic ring revisited")
  Member "computability of perpetual exploration in highly dynamic rings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gracefully degrading gathering in dynamic rings")
  Member "live exploration of dynamic rings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "live exploration with mobile robots in a dynamic ring revisited")
  Member "enabling minimal dominating set in highly dynamic distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robustness a new form of heredity motivated by dynamic networks")
  Member "the next 700 impossibility results in time varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robustness a new form of heredity motivated by dynamic networks")
  Member "time varying graphs and dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "edge disjoint branchings in temporal graphs")
  Member "exploration of periodically varying graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "temporal vertex cover with a sliding time window")
  Member "on the self stabilization of mobile robots in graphs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "quiescence of self stabilizing gossiping among mobile agents in graphs")

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)