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: "mir bft high throughput bft for blockchains"
  Abstract: This paper presents Mir-BFT (or, simply, Mir), a robust Byzantine fault-tolerant (BFT) total order broadcast protocol aimed at maximizing throughput on wide-area networks (WANs), targeting permissioned and Proof-of-Stake permissionless blockchains. #R##N#We show that Mir achieves unprecedented throughput on WANs without sacrificing latency, robustness to malicious behavior, or even performance in clusters. Our evaluation shows that Mir orders more than 60000 signed Bitcoin-sized transactions per second on a widely distributed 100 nodes, 1 Gbps WAN setup, while preventing a range of attacks including request duplication performance attacks. #R##N#To achieve this, Mir relies on a novel protocol mechanism that allows a set of leaders to propose request batches independently, in parallel, while rotating the assignment of a partitioned request hash space to leaders. Several optimizations boost Mir throughput even further, including partial replication through a novel abstraction we call light total order (LTO) broadcast. #R##N#Perhaps most importantly, Mir relies on proven BFT protocol constructs, which simplifies reasoning about Mir correctness. Specifically, Mir is a generalization of the celebrated and scrutinized PBFT protocol. In a nutshell, Mir follows PBFT ``safety-wise'', with changes needed to accommodate novel features restricted to PBFT liveness.

Connected through hyperedge HE-1 (induced by source paper "the sum of its parts analysis of federated byzantine agreement systems"):
  with members:
    - "rationality is self defeating in permissionless systems"
    - "mathematical analysis and algorithms for federated byzantine agreement systems"
    - "complexity of the quorum intersection property of the federated byzantine agreement system"
    - "committee selection is more similar than you think evidence from avalanche and stellar"
    - "is stellar as secure as you think"
    - "asymmetric distributed trust"

Connected through hyperedge HE-2 (induced by source paper "dispel byzantine smr with distributed pipelining"):
  with members:
    - "certifying blockchain byzantine fault tolerance"
    - "evaluating the red belly blockchain"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "sbft a scalable decentralized trust infrastructure for blockchains"
    - "a byzantine fault tolerant ordering service for the hyperledger fabric blockchain platform"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "bitcoin ng a scalable blockchain protocol"

Connected through hyperedge HE-3 (induced by source paper "scaling blockchain databases through parallel resilient consensus paradigm"):
  with members:
    - "blockchain meets database design and implementation of a blockchain relational database"
    - "vchain enabling verifiable boolean range queries over blockchain databases"
    - "towards scaling blockchain systems via sharding"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "blockbench a framework for analyzing private blockchains"
    - "revisiting fast practical byzantine fault tolerance"

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.DC(Distributed, Parallel, and Cluster Computing)