human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "surface a practical blockchain consensus algorithm for real world networks"):
  Abstract: SURFACE, standing for Secure, Use-case adaptive, and Relatively Fork-free Approach of Chain Extension, is a consensus algorithm that is designed for real-world networks and enjoys the benefits from both the Nakamoto consensus and Byzantine Fault Tolerance (BFT) consensus. In SURFACE, a committee is randomly selected every round to validate and endorse the proposed new block. The size of the committee can be adjusted according to the underlying network to make the blockchain mostly fork-free with a reasonable overhead in communication. Consequently, the blockchain can normally achieve fast probabilistic confirmation with high throughput and low latency. SURFACE also provides a BFT mechanism to guarantee ledger consistency in case of an extreme network situation such as large network partition or being under a massive DDoS attack.

Includes members:
  Member "rationality is self defeating in permissionless systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the sum of its parts analysis of federated byzantine agreement systems")
  Member "dfinity technology overview series consensus system":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "hotstuff bft consensus in the lens of blockchain":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on exploiting transaction concurrency to speed up blockchains")
  Member "deconstructing the blockchain to approach physical limits":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "topology aware cooperative data protection in blockchain based decentralized storage networks")
  Member "scaling nakamoto consensus to thousands of transactions per second":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective scaling of blockchain beyond consensus innovations and moore s law")
  Member "transaction propagation on permissionless blockchains incentive and routing mechanisms":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "sok tools for game theoretic models of security for cryptocurrencies")
  Member "implicit consensus blockchain with unbounded throughput":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "blockchain technologies for smart energy systems fundamentals challenges and solutions")
  Member "chainspace a sharded smart contracts platform":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "verifiable and auditable digital interchange framework")

Question: Please tell me which class the source paper 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)