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: "blockchain abstract data type"
  Abstract: Blockchains (e.g. Bitcoin, Algorand, Byzcoin, Hyperledger, RedBelly etc) became a game changer in the distributed storage area due to their ability to mimic the functioning of a classical traditional ledger such as transparency and falsification-proof of documentation in an untrusted environment where the computation is distributed, the set of participants to the system are not known and it varies during the execution. However, the massive integration of distributed ledgers in industrial applications strongly depends on the formal guaranties of the quality of services offered by these applications, especially in terms of consistency. Our work continues the line of recent distributed computing community effort dedicated to the theoretical aspects of blockchains. This paper is the first to specify the distributed shared ledgers as a composition of \emph{abstract data types} all together with an hierarchy of \emph{consistency criteria} that formally characterizes the histories admissible for distributed programs that use them. Our work extends the consistency criteria theory with new consistency definitions that capture the eventual convergence process in blockchain systems. Furthermore, we map representative existing blockchains from both academia and industry in our framework. Finally, we identify the necessary communication conditions in order to implement the new defined consistency criteria.

Connected through hyperedge HE-1 (induced by source paper "appending atomically in byzantine distributed ledgers"):
  with members:
    - "atomic appends selling cars and coordinating armies with multiple distributed ledgers"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "atomic cross chain swaps"

Connected through hyperedge HE-2 (induced by source paper "on fairness in committee based blockchains"):
  with members:
    - "cryptocurrency egalitarianism a quantitative approach"
    - "fairledger a fair blockchain protocol for financial institutions"
    - "dissecting tendermint"
    - "compounding of wealth in proof of stake cryptocurrencies"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "sbft a scalable decentralized trust infrastructure for blockchains"
    - "leader randomization signature free byzantine consensus for consortium blockchains"
    - "enhancing accountability and trust in distributed ledgers"

Connected through hyperedge HE-3 (induced by source paper "rationals vs byzantines in consensus based blockchains"):
  with members:
    - "hotstuff bft consensus in the lens of blockchain"
    - "a game theoretic analysis of shard based permissionless blockchains"
    - "leader randomization signature free byzantine consensus for consortium blockchains"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "optimal selfish mining strategies in bitcoin"
    - "bitcoin ng a scalable blockchain protocol"
    - "bitcoin meets strong consistency"
    - "majority is not enough bitcoin mining is vulnerable"

Connected through hyperedge HE-4 (induced by source paper "dissecting tendermint"):
  with members:
    - "the latest gossip on bft consensus"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "correctness and fairness of tendermint core blockchains"
    - "dbft efficient byzantine consensus with a weak coordinator and its application to consortium blockchains"
    - "leader randomization signature free byzantine consensus for consortium blockchains"
    - "enhancing bitcoin security and performance with strong consistency via collective signing"
    - "bitcoin meets strong consistency"

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)