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 "almost logarithmic time space optimal leader election in population protocols"):
  Abstract: The model of population protocols refers to a large collection of simple indistinguishable entities, frequently called agents. The agents communicate and perform computation through pairwise interactions. We study fast and space efficient leader election in population of cardinality $n$ governed by a random scheduler, where during each time step the scheduler uniformly at random selects for interaction exactly one pair of agents. #R##N#We propose the first $o(\log^2 n)$-time leader election protocol. Our solution operates in expected parallel time $O(\log n\log\log n)$ which is equivalent to $O(n \log n\log\log n)$ pairwise interactions. This is the fastest currently known leader election algorithm in which each agent utilises asymptotically optimal number of $O(\log\log n)$ states. The new protocol incorporates and amalgamates successfully the power of assorted synthetic coins with variable rate phase clocks.

Includes members:
  Member "fast space optimal leader election in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "leader election requires logarithmic time in population protocols")
  Member "space optimal majority in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "robust comparison in population protocols")
  Member "time space trade offs in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "robust comparison in population protocols")
  Member "time vs information tradeoffs for leader election in anonymous trees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "deterministic leader election in anonymous radio networks")
  Member "on convergence and threshold properties of discrete lotka volterra population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on analog models of computation")
  Member "stable leader election in population protocols requires linear time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constructive expressive power of population protocols")
  Member "plurality consensus in the gossip model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "distributed voting in beep model")

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)