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: "xft practical fault tolerance beyond crashes"
  Abstract: Despite years of intensive research, Byzantine fault-tolerant (BFT) systems have not yet been adopted in practice. This is due to additional cost of BFT in terms of resources, protocol complexity and performance, compared with crash fault-tolerance (CFT). This overhead of BFT comes from the assumption of a powerful adversary that can fully control not only the Byzantine faulty machines, but at the same time also the message delivery schedule across the entire network, effectively inducing communication asynchrony and partitioning otherwise correct machines at will. To many practitioners, however, such strong attacks appear irrelevant. #R##N#In this paper, we introduce cross fault tolerance or XFT, a novel approach to building reliable and secure distributed systems and apply it to the classical state-machine replication (SMR) problem. In short, an XFT SMR protocol provides the reliability guarantees of widely used asynchronous CFT SMR protocols such as Paxos and Raft, but also tolerates Byzantine faults in combination with network asynchrony, as long as a majority of replicas are correct and communicate synchronously. This allows the development of XFT systems at the price of CFT (already paid for in practice), yet with strictly stronger resilience than CFT --- sometimes even stronger than BFT itself. #R##N#As a showcase for XFT, we present XPaxos, the first XFT SMR protocol, and deploy it in a geo-replicated setting. Although it offers much stronger resilience than CFT SMR at no extra resource cost, the performance of XPaxos matches that of the state-of-the-art CFT protocols.

Connected through hyperedge HE-1 (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"):
  with members:
    - "a simple and efficient binary byzantine consensus algorithm using cryptography and partial synchrony"
    - "a simple and efficient asynchronous randomized binary byzantine consensus algorithm"
    - "cobalt bft governance in open networks"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-2 (induced by source paper "a simple and efficient asynchronous randomized binary byzantine consensus algorithm"):
  with members:
    - "a simple and efficient binary byzantine consensus algorithm using cryptography and partial synchrony"
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-3 (induced by source paper "network agnostic state machine replication"):
  with members:
    - "flexible byzantine fault tolerance"

Connected through hyperedge HE-4 (induced by source paper "a simple and efficient binary byzantine consensus algorithm using cryptography and partial synchrony"):
  with members:
    - "randomized protocols for asynchronous consensus"

Connected through hyperedge HE-5 (induced by source paper "a survey on consensus mechanisms and mining strategy management in blockchain networks"):
  with members:
    - "decentralization in bitcoin and ethereum networks"
    - "information and communications technologies for sustainable development goals state of the art needs and perspectives"
    - "a scale out blockchain for value transfer with spontaneous sharding"
    - "a survey on security and privacy issues of bitcoin"
    - "on cyber risk management of blockchain networks a game theoretic approach"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "competitive data trading in wireless powered internet of things iot crowdsensing systems with blockchain"
    - "blockchained on device federated learning"

Connected through hyperedge HE-6 (induced by source paper "deconstructing blockchains a comprehensive survey on consensus membership and structure"):
  with members:
    - "dfinity technology overview series consensus system"
    - "analysis of the xrp ledger consensus protocol"
    - "hotstuff bft consensus in the lens of blockchain"
    - "evaluating the red belly blockchain"
    - "an empirical analysis of anonymity in zcash"
    - "a survey on security and privacy issues of bitcoin"
    - "blockchains consensus protocols in the wild"
    - "cachezoom how sgx amplifies the power of cache attacks"

Connected through hyperedge HE-7 (induced by source paper "can 100 machines agree"):
  with members:
    - "the consensus number of a cryptocurrency"
    - "sbft a scalable and decentralized trust infrastructure"
    - "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"
    - "revisiting fast practical byzantine fault tolerance"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "incremental consistency guarantees for replicated objects"

Connected through hyperedge HE-8 (induced by source paper "gdpr compliant personal data management a blockchain based solution"):
  with members:
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "towards blockchain based auditable storage and sharing of iot data"
    - "a blockchain based approach for data accountability and provenance tracking"
    - "blockbench a framework for analyzing private blockchains"
    - "untangling blockchain a data processing view of blockchain systems"
    - "ipfs content addressed versioned p2p file system"

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)