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 "scalable and efficient data authentication for decentralized systems"):
  Abstract: Decentralized systems such as blockchains promise to fundamentally change how untrusted parties exchange data and assets. A key challenge in the decentralized setting is scalably authenticating data in the system. Merkle Patricia trees (MPT) are widely used in decentralized systems like Ethereum, to verify that the data is correct and up-to-date. Unfortunately, MPTs incur significant overhead due to random IO operations, serialization, and hashing. This paper presents the Distributed Merkle Patrica Tree (DMPT), a novel data structure that reduces the overheads of the MPT. A DMPT vertically shards the MPT across the memory of multiple nodes, eliminating the IO bottleneck. DMPTs reduce network bandwidth utilization using a combination of novel techniques such as witness compaction and node bagging. Compared to the MPT used in Ethereum, put and get operations in the DMPT achieve 80-160x better throughput, even when the Ethereum MPT is stored in memory. We demonstrate the effectiveness of DMPT by building FVCHAIN (Fast Verification blockchain), a modified version of Ethereum which uses DMPT instead of MPT. In a four-region geo-distributed deployment, FVCHAIN can verify 20,000 transactions per second (20x higher than Ethereum).

Includes members:
  Member "empirically analyzing ethereum s gas mechanism":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "step on the gas a better approach for recommending the ethereum gas price")
  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 "hyperledger fabric a distributed operating system for permissioned blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "blockchains consensus protocols in the wild":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "consensus in the age of blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "bitcoin ng a scalable blockchain protocol":
    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)