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 "ohie blockchain scaling made simple"):
  Abstract: Many blockchain consensus protocols have been proposed recently to scale the throughput of a blockchain with available bandwidth. However, these protocols are becoming increasingly complex, making it more and more difficult to produce proofs of their security guarantees. We propose a novel permissionless blockchain protocol OHIE which explicitly aims for simplicity. OHIE composes as many parallel instances of Bitcoin's original (and simple) backbone protocol as needed to achieve excellent throughput. We formally prove the safety and liveness properties of OHIE. We demonstrate its performance with a prototype implementation and large-scale experiments with up to 50,000 nodes. In our experiments, OHIE achieves linear scaling with available bandwidth, providing about 4-10 Mbps transaction throughput (under 8-20 Mbps per-node available bandwidth configurations) and at least about 20x better decentralization over prior works.

Includes members:
  Member "decentralization in bitcoin and ethereum networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stability and scalability of blockchain systems")
  Member "deconstructing the blockchain to approach physical limits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "scaling nakamoto consensus to thousands of transactions per second":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "chainspace a sharded smart contracts platform":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "revisiting fast practical byzantine fault tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks")
  Member "the balance attack against proof of work blockchains the r3 testbed as an example":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "continuous time analysis of the bitcoin and prism backbone protocols")
  Member "hijacking bitcoin routing attacks on cryptocurrencies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an overview on smart contracts challenges advances and platforms")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")

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)