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: "certifying blockchain byzantine fault tolerance"
  Abstract: To implement a blockchain, the trend is now to integrate a non-trivial Byzantine fault tolerant consensus algorithm instead of the seminal idea of waiting to receive blocks to decide upon the longest branch. After a decade of existence, blockchains trade now large amounts of valuable assets and a simple disagreement could lead to disastrous losses. Unfortunately, Byzantine consensus solutions used in blockchains are at best proved correct "by hand'' as we are not aware of any of them having been certified. #R##N#In this paper, we propose two contributions: (i) we illustrate the severity of the problem by listing six vulnerabilities of blockchain consensus including two new counter-examples; (ii) we then certify two Byzantine fault tolerant components of Red Belly Blockchain using the ByMC model checker: First, we specify a simple broadcast primitive in 116 lines that is certified in 40 seconds on a 2-core Intel machine and a blockchain consensus algorithm written in 309 lines of code and certified, using MPI, in 17 minutes on a 64-core AMD machine. To conclude, we argue that it has now become both relatively simple and crucial to certify the correctness of blockchain consensus protocols.

Connected through hyperedge HE-1 (induced by source paper "dispel byzantine smr with distributed pipelining"):
  with members:
    - "mir bft high throughput bft for blockchains"
    - "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"

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)