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 "leader election requires logarithmic time in population protocols"):
  Abstract: In this paper, it is shown that any leader election problem requires logarithmic stabilization time in the population protocol model. This lower bound holds even if each agent has knowledge of the exact size of a population and we can use arbitrarily large number of agent states. This lower bound concludes that the protocol given in [Sudo et al., PODC 2019] is optimal in terms of stabilization time.

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 "fast space optimal leader election in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust comparison in population protocols")
  Member "logarithmic expected time leader election in population protocol model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "uniform partition in population protocol model under weak fairness")
  Member "space optimal majority in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust comparison in population protocols")
  Member "time space trade offs in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "robust comparison in population protocols")
  Member "stable leader election in population protocols requires linear time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "constructive expressive power of 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)