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 "expressive power of broadcast consensus protocols"):
  Abstract: Population protocols are a formal model of computation by identical, anonymous mobile agents interacting in pairs. Their computational power is rather limited: Angluin et al. have shown that they can only compute the predicates over $\mathbb{N}^k$ expressible in Presburger arithmetic. For this reason, several extensions of the model have been proposed, including the addition of devices called cover-time services, absence detectors, and clocks. All these extensions increase the expressive power to the class of predicates over $\mathbb{N}^k$ lying in the complexity class NL when the input is given in unary. However, these devices are difficult to implement, since they require that an agent atomically receives messages from all other agents in a population of unknown size; moreover, the agent must know that they have all been received. Inspired by the work of the verification community on Emerson and Namjoshi's broadcast protocols, we show that NL-power is also achieved by extending population protocols with reliable broadcasts, a simpler, standard communication primitive.

Includes members:
  Member "affine extensions of integer vector addition systems with states":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the well structured problem for presburger counter machines")
  Member "controlling a population":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "controlling a random population")
  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 "context free commutative grammars with integer counters and resets":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "composition problems for braids membership identity and freeness")
  Member "the power of well structured systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "the computational power of population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)