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 "efficient self stabilizing leader election in population protocols"):
  Abstract: We consider the standard population protocol model, where (a priori) indistinguishable and anonymous agents interact in pairs according to uniformly random scheduling. In this model, the only previously known protocol solving the self-stabilizing leader election problem by Cai, Izumi, and Wada [Theor. Comput. Syst. 50] runs in expected parallel time $\Theta(n^2)$ and has the optimal number of n states in a population of n agents. This protocol has the additional property that it becomes silent, i.e., the agents' states eventually stop changing. Observing that any silent protocol solving self-stabilizing leader election requires $\Omega(n)$ expected parallel time, we introduce a silent protocol that runs in optimal $O(n)$ expected parallel time with an exponential number of states, as well as a protocol with a slightly worse expected time complexity of $O(n\log n)$ but with the asymptotically optimal $O(n)$ states. Without any silence or state space constraints, we show that it is possible to solve self-stabilizing leader election in optimal expected parallel time of $O(\log n)$. All of our protocols (and also that of Cai et al.) work by solving the more difficult ranking problem: assigning agents the ranks 1,...,n.

Includes members:
  Member "almost logarithmic time space optimal leader election in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the power of global knowledge on self stabilizing population protocols")
  Member "hardness of computing and approximating predicates and functions with leaderless population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "composable computation in discrete chemical reaction networks")
  Member "population protocols with faulty interactions the impact of a leader":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "synchronous byzantine lattice agreement in o log f rounds")
  Member "homonym population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on analog models of computation")
  Member "naming and counting in anonymous unknown dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed computation and reconfiguration in actively dynamic networks")
  Member "playing with population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "asymetric pavlovian populations")

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)