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 "the istanbul bft consensus algorithm"):
  Abstract: This paper presents Istanbul BFT (IBFT), a Byzantine fault-tolerant (BFT) consensus algorithm that is used for implementing state-machine replication in the Quorum blockchain, n open source permissioned blockchain platform. IBFT belongs to a class of BFT algorithms that assume a partially synchronous communication model. The IBFT algorithm is deterministic, leader-based, and optimally resilient - tolerating $f$ faulty processes out of $n$, where $n \geq 3f+1$. During periods of good communication, IBFT achieves termination in three message delays. The communication complexity is $O(n^2)$ for normal operation and $O(n)$ for round (or view) changes. We also introduce a variant of IBFT, which achieves $O(n)$ communication complexity during both normal operation and view changes at a small latency penalty compared to IBFT - from 3 to 5 message delays.

Includes members:
  Member "the latest gossip on bft consensus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "sbft a scalable and decentralized trust infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expected linear round synchronization the missing link for linear byzantine smr")
  Member "casper the friendly finality gadget":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")

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)