human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "scaling blockchain databases through parallel resilient consensus paradigm"
  Abstract: The recent surge in blockchain applications and database systems has renewed the interest in traditional Byzantine Fault Tolerant consensus protocols (BFT). Several such BFT protocols follow a primary-backup design, in which a primary} replica coordinates the consensus protocol. In primary-backup designs, the normal-case operations are rather simple. At the same time, primary-backup designs place an unreasonable burden on primaries and allows malicious primaries to affect the system throughput substantially, however. To resolve this situation, we propose the MultiBFT paradigm, a protocol-agnostic approach towards improving the performance of primary-backup consensus protocols. At the core of MultiBFT is an approach to continuously order the client-transactions by running several instances of the underlying BFT protocol in parallel. We bring forth our paradigm to two well-established BFT protocols and demonstrate that the rendered parallelized protocols are not only safe and live but also significantly outperform, up to $2\times$, their original non-parallelized forms. Further, we show that our MultiBFT paradigm reaches a throughput of up to $320$K transactions per second.

Connected through hyperedge HE-1 (induced by source paper "sharper sharding permissioned blockchains over network clusters"):
  with members:
    - "resilientdb global scale resilient blockchain fabric"
    - "parblockchain leveraging transaction parallelism in permissioned blockchain systems"
    - "fastfabric scaling hyperledger fabric to 20 000 transactions per second"
    - "topological analysis of bitcoin s lightning network"
    - "seemore a fault tolerant protocol for hybrid cloud environments"
    - "streamchain do blockchains need blocks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "towards scaling blockchain systems via sharding"

Connected through hyperedge HE-2 (induced by source paper "permissioned blockchain through the looking glass architectural and implementation lessons learned"):
  with members:
    - "proof of execution reaching consensus through fault tolerant speculation"
    - "scalable byzantine consensus via hardware assisted secret sharing"
    - "revisiting consensus protocols through wait free parallelization"
    - "streamchain do blockchains need blocks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "revisiting fast practical byzantine fault tolerance"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"

Question: Please tell me which class the center node 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.DB(Databases)