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 "ostraka secure blockchain scaling by node sharding"):
  Abstract: Cryptocurrencies, which promise to become a global means of money transactions, are typically implemented with blockchain protocols. Blockchains utilize a variety of consensus algorithms, and their performance is advancing rapidly. However, a bottleneck remains: each node processes all transactions in the system. We present Ostraka, a blockchain node architecture that scales linearly with the available resources. Ostraka shards (parallelizes) the nodes themselves, embracing the fact that major actors have the resources to deploy multi-server nodes. We show that, in common scenarios, previous sharding solutions have the same property, requiring most node operators resources to process almost all blockchain transactions, while reducing system security. We prove that replacing a unified node with a sharded Ostraka node does not affect the security of the underlying consensus mechanism and that Ostraka does not expose additional vulnerabilities due to its sharding. We identify a partial denial-of-service attack that is exposed by previous sharding solutions. We evaluate analytically and experimentally block propagation and processing in various settings. Ostraka achieves linear scaling when the network allows it, unlike previous systems that require costly coordination for transactions that affect multiple shards. In our experiments, Ostraka nodes reach a rate of nearly 400,000 transactions per second with 64 shards, opening the door to truly high-frequency blockchains.

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 "hotstuff bft consensus in the lens of blockchain":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "split scale scaling bitcoin by partitioning the utxo space":
    also connected through other hyperedges:
      (none)
  Member "dietcoin shortcutting the bitcoin verification process for your smartphone":
    also connected through other hyperedges:
      (none)
  Member "chainspace a sharded smart contracts platform":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "adding concurrency to smart contracts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview on smart contracts challenges advances and platforms")
  Member "casper the friendly finality gadget":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)