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 "leader randomization signature free byzantine consensus for consortium blockchains"):
  Abstract: This paper presents a new Byzantine consensus algorithm targeting consortium blockchains. To this end, it first revisits the consensus validity property by requiring that the decided value satisfies a predefined predicate, which does not systematically exclude a value proposed only by Byzantine processes, thereby generalizing the validity properties found in the literature. Then, the paper presents a simple and modular Byzantine consensus algorithm that relies neither on a leader, nor on signatures, nor on randomization. It features the fastest multivalued reduction to binary consensus we know of and a time optimal binary Byzantine consensus algorithm. The multivalued reduction runs multiple instances of binary consensus concurrently, which result in a bitmask that is then applied to a vector of multivalued proposals to filter out a valid proposed value that is decided. To ensure eventual decision deterministically, the underlying binary consensus algorithm assumes eventual synchrony.

Includes members:
  Member "the blockchain anomaly":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an overview on smart contracts challenges advances and platforms")
  Member "algorand the efficient and democratic ledger":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "consistency of proof of stake blockchains with concurrent honest slot leaders")
  Member "approximate agreement under mobile byzantine faults":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an improved approximate consensus algorithm in the presence of mobile faults")
  Member "xft practical fault tolerance beyond crashes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two more algorithms for randomized signature free asynchronous binary byzantine consensus with t n 3 and o n 2 messages and o 1 round expected termination")
  Member "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "randomized protocols for asynchronous consensus":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks")

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)