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 "dynamic byzantine reliable broadcast technical report"):
  Abstract: Reliable broadcast is a powerful primitive guaranteeing that, intuitively, all processes in a distributed system deliver the same set of messages. There is a twofold reason why this primitive is appealing: (i) we can implement it deterministically in a completely asynchronous environment, unlike stronger primitives like consensus and total-order broadcast, and yet (ii) it is powerful enough to implement numerous useful applications like payment systems. #R##N#The problem we tackle in this paper is that of dynamic reliable broadcast, i.e., enabling processes to join or leave the system. This is desirable property for long-lived applications supposed to be highly available, yet has been precluded in previous asynchronous reliable broadcast protocols. #R##N#We introduce the first specification of a dynamic Byzantine reliable broadcast (DBRB) primitive that is amenable to an asynchronous implementation. Indeed, we present an algorithm that implements this specification in an asynchronous environment. Our algorithm ensures that if any correct process in the system broadcasts (resp. delivers) a message, then every correct process in the system delivers that message, or leaves the system. We assume that, at any point in time, 2/3 of the processes in the system are correct, which is tight. We also prove that even if only one process in the system can fail---and it can fail by merely crashing---then it is impossible to implement a stronger primitive, ensuring that if any correct process in the system broadcasts (resp. delivers) a message, then every correct process in the system delivers that message, including those that eventually leave.

Includes members:
  Member "the consensus number of a cryptocurrency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "formal verification of blockchain byzantine fault tolerance")
  Member "at2 asynchronous trustworthy transfers":
    also connected through other hyperedges:
      (none)

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)