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 "on fast probabilistic consensus in the byzantine setting"):
  Abstract: In this paper we discuss a leaderless protocol of low communicational complexity which allows a set of nodes to come to a consensus on a value of a bit. In addition, we assume that part of the nodes are Byzantine, i.e., they are controlled by an adversary who intends to either delay the consensus, or break it (i.e., make at least a couple of honest nodes come to different conclusions). We prove that, nevertheless, the protocol works with high probability when its parameters are suitably chosen, and we also provide some explicit estimates on the probability that the protocol finalizes in the consensus state in a given time. This protocol can possibly be applied to reaching consensus in decentralized cryptocurrency systems. A special feature of our protocol is that it makes use of a sequence of random numbers which are either provided by a trusted source or generated by the nodes themselves using some decentralized random number generating protocol.

Includes members:
  Member "communication cost of consensus for nodes with limited memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fpc bi fast probabilistic consensus within byzantine infrastructures")
  Member "scalable byzantine consensus via hardware assisted secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective scaling of blockchain beyond consensus innovations and moore s law")
  Member "rapid asynchronous plurality consensus":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "noidy conmunixatipn on the convergence of the averaging population protocol")
  Member "stabilizing consensus with many opinions":
    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 "the power of two choices in distributed voting":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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)