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 "broadcast distributed voting algorithm in population protocols"):
  Abstract: We consider the problem of multi-choice majority voting in a network of $n$ agents where each agent initially selects a choice from a set of $K$ possible choices. The agents try to infer the choice in majority merely by performing local interactions. Population protocols provide a framework for designing pairwise interactions between agents in order to perform tasks in a coordinated manner. In this paper, we propose ``Broadcasting Population Protocol" model as a counterpart model of conventional population protocols for the networks that each agent can send a message to all its neighbors simultaneously. We design two distributed algorithms for solving the multi-choice majority voting problem in the model of broadcasting population protocols. We prove the correctness of these algorithms and analyze their performance in terms of time and message complexities. Experiments show that the proposed algorithm improves both time and message complexities significantly with respect to previous algorithms proposed in conventional population protocols and they can be utilized in networks where messages can be transmitted to a subset of agents simultaneously such as wireless networks.

Includes members:
  Member "distributed voting ranking with optimal number of states per node":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "distributed voting in beep model")
  Member "space optimal majority in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "robust comparison in population protocols")
  Member "time space trade offs in population protocols":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "on the necessary memory to compute the plurality in multi agent systems")
  Member "stable leader election in population protocols requires linear time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "constructive expressive power of population protocols")
  Member "deterministic function computation with chemical reaction networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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.MA(Multiagent Systems)