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 "stable leader election in population protocols requires linear time"):
  Abstract: A population protocol *stably elects a leader* if, for all $n$, starting from an initial configuration with $n$ agents each in an identical state, with probability 1 it reaches a configuration $\mathbf{y}$ that is correct (exactly one agent is in a special leader state $\ell$) and stable (every configuration reachable from $\mathbf{y}$ also has a single agent in state $\ell$). We show that any population protocol that stably elects a leader requires $\Omega(n)$ expected "parallel time" --- $\Omega(n^2)$ expected total pairwise interactions --- to reach such a stable configuration. Our result also informs the understanding of the time complexity of chemical self-organization by showing an essential difficulty in generating exact quantities of molecular species quickly.

Includes members:
  Member "time space trade offs in molecular computation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "composable computation in discrete chemical reaction networks")
  Member "time space trade offs in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust comparison in population protocols")
  Member "time and space optimal counting in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the necessary memory to compute the plurality in multi agent systems")
  Member "timing in chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication cost of consensus for nodes with limited memory")
  Member "deterministic function computation with chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "distributed voting in beep model")
  Member "the computational power of population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "robust comparison in population protocols")

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)