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: "dfinity technology overview series consensus system"
  Abstract: The DFINITY blockchain computer provides a secure, performant and flexible consensus mechanism. At its core, DFINITY contains a decentralized randomness beacon which acts as a verifiable random function (VRF) that produces a stream of outputs over time. The novel technique behind the beacon relies on the existence of a unique-deterministic, non-interactive, DKG-friendly threshold signatures scheme. The only known examples of such a scheme are pairing-based and derived from BLS. #R##N#The DFINITY blockchain is layered on top of the DFINITY beacon and uses the beacon as its source of randomness for leader selection and leader ranking. A "weight" is attributed to a chain based on the ranks of the leaders who propose the blocks in the chain, and that weight is used to select between competing chains. The DFINITY blockchain is layered on top of the DFINITY beacon and uses the beacon as its source of randomness for leader selection and leader ranking blockchain is further hardened by a notarization process which dramatically improves the time to finality and eliminates the nothing-at-stake and selfish mining attacks. #R##N#DFINITY consensus algorithm is made to scale through continuous quorum selections driven by the random beacon. In practice, DFINITY achieves block times of a few seconds and transaction finality after only two confirmations. The system gracefully handles temporary losses of network synchrony including network splits, while it is provably secure under synchrony.

Connected through hyperedge HE-1 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks"):
  with members:
    - "rationality is self defeating in permissionless systems"
    - "hotstuff bft consensus in the lens of blockchain"
    - "deconstructing the blockchain to approach physical limits"
    - "scaling nakamoto consensus to thousands of transactions per second"
    - "transaction propagation on permissionless blockchains incentive and routing mechanisms"
    - "implicit consensus blockchain with unbounded throughput"
    - "chainspace a sharded smart contracts platform"
    - "casper the friendly finality gadget"

Connected through hyperedge HE-2 (induced by source paper "tenderbake classical bft style consensus for public blockchains"):
  with members:
    - "correctness analysis of ibft"
    - "introduction to the tezos blockchain"
    - "dissecting tendermint"
    - "the latest gossip on bft consensus"
    - "hyperledger fabric a distributed operating system for permissioned blockchains"
    - "blockchains consensus protocols in the wild"
    - "consensus in the age of blockchains"
    - "leader randomization signature free byzantine consensus for consortium blockchains"

Connected through hyperedge HE-3 (induced by source paper "snappy fast on chain payments with practical collaterals"):
  with members:
    - "gosig scalable byzantine consensus on adversarial wide area network for blockchains"
    - "towards an economic analysis of routing in payment channel networks"
    - "sprites and state channels payment networks that go faster than lightning"
    - "consensus in the age of blockchains"
    - "casper the friendly finality gadget"
    - "strong federations an interoperable blockchain solution to centralized third party risks"

Connected through hyperedge HE-4 (induced by source paper "flow separating consensus and compute block formation and execution"):
  with members:
    - "flow separating consensus and compute execution verification"
    - "flow separating consensus and compute"
    - "hotstuff bft consensus in the lens of blockchain"

Connected through hyperedge HE-5 (induced by source paper "not a coincidence sub quadratic asynchronous byzantine agreement whp"):
  with members:
    - "communication complexity of byzantine agreement revisited"
    - "the cost of global broadcast in dynamic radio networks"
    - "breaking the o n 2 bit barrier scalable byzantine agreement with an adaptive adversary"

Connected through hyperedge HE-6 (induced by source paper "combining ghost and casper"):
  with members:
    - "the latest gossip on bft consensus"
    - "hotstuff bft consensus in the lens of blockchain"
    - "casper the friendly finality gadget"

Connected through hyperedge HE-7 (induced by source paper "the security reference architecture for blockchains towards a standardized model for studying vulnerabilities threats and defenses"):
  with members:
    - "ekiden a platform for confidentiality preserving trustworthy and performant smart contracts"
    - "a survey on ethereum systems security vulnerabilities attacks and defenses"
    - "security and privacy on blockchain"
    - "deconstructing blockchains a comprehensive survey on consensus membership and structure"
    - "truffle tests for free replaying ethereum smart contracts for transparency"
    - "blockchain technologies for the internet of things research issues and challenges"
    - "exploring the attack surface of blockchain a systematic overview"
    - "strongchain transparent and collaborative proof of work consensus"

Connected through hyperedge HE-8 (induced by source paper "a security reference architecture for blockchains"):
  with members:
    - "ekiden a platform for confidentiality preserving trustworthy and performant smart contracts"
    - "strongchain transparent and collaborative proof of work consensus"
    - "insight into insiders and it a survey of insider threat taxonomies analysis modeling and countermeasures"
    - "short paper towards more reliable bitcoin timestamps"
    - "the latest gossip on bft consensus"
    - "finding the greedy prodigal and suicidal contracts at scale"
    - "sabre protecting bitcoin against routing attacks"
    - "scilla a smart contract intermediate level language"

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)