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 "tenderbake classical bft style consensus for public blockchains"):
  Abstract: Our work has been originally motivated by Tezos, a public blockchain which focuses on software correctness and which enables formal reasoning and verification. To further strengthen the resilience of Tezos, which now depends on a consensus protocol delivering only probabilistic finality, we propose a consensus protocol that brings deterministic finality. Our solution is backward compatible with the current liquid proof-of-stake system underlying Tezos. The main contributions of this paper are the following: (i) a formal specification of the Dynamic Repeated Consensus (DRC) problem, an adaptation of the repeated consensus problem to dynamic committees, (ii) Tenderbake, a solution to the DRC problem in a Byzantine and partially synchronous system model. In contrast to recent proposals, Tenderbake works with bounded message buffers. This feature represents a countermeasure to spamming and prevents runtime memory errors. For these reasons we think that Tenderbake is suitable for blockchains aiming to guarantee deterministic finality in a public setting.

Includes members:
  Member "correctness analysis of ibft":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "formal verification of blockchain byzantine fault tolerance")
  Member "introduction to the tezos blockchain":
    also connected through other hyperedges:
      (none)
  Member "dissecting tendermint":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formal verification of blockchain byzantine fault tolerance")
  Member "dfinity technology overview series consensus system":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "the latest gossip on bft consensus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "in search for a linear byzantine agreement")
  Member "hyperledger fabric a distributed operating system for permissioned blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "formalising and verifying smart contracts with solidifier a bounded model checker for solidity")
  Member "blockchains consensus protocols in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "blockchain consensus algorithms a survey")
  Member "consensus in the age of blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")

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)