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 "permissioned blockchain through the looking glass architectural and implementation lessons learned"):
  Abstract: Since the inception of Bitcoin, the distributed and database community has shown interest in the design of efficient blockchain systems. At the core of any blockchain application is a Byzantine-Fault Tolerant (BFT) protocol that helps a set of replicas reach an agreement on the order of a client request. Initial blockchain applications (like Bitcoin) attain very low throughput and are computationally expensive. Hence, researchers moved towards the design of permissioned blockchain systems that employ classical BFT protocols, such as PBFT, to reach consensus. However, existing permissioned blockchain systems still attain low throughputs (of the order 10K txns/s). As a result, existing works blame this low throughput on the associated BFT protocol and expend resources in developing optimizes protocols. We believe such blames only depict a one-sided story. In specific, we raise a simple question: can a well-crafted system based on a classical BFT protocol outperform a modern protocol? We show that designing such a well-crafted system is possible and illustrate cases where a three-phase protocol can outperform a single-phase protocol. Further, we dissect a permissioned blockchain system and state several factors that affect its performance. We also design a high-throughput yielding permissioned blockchain system, ResilientDB, that employs parallel pipelines to balance tasks at a replica, and provides guidelines for future designs.

Includes members:
  Member "proof of execution reaching consensus through fault tolerant speculation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resilientdb global scale resilient blockchain fabric")
  Member "scaling blockchain databases through parallel resilient consensus paradigm":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sharper sharding permissioned blockchains over network clusters")
  Member "scalable byzantine consensus via hardware assisted secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "effective scaling of blockchain beyond consensus innovations and moore s law")
  Member "revisiting consensus protocols through wait free parallelization":
    also connected through other hyperedges:
      (none)
  Member "streamchain do blockchains need blocks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "sharper sharding permissioned blockchains over network clusters")
  Member "hyperledger fabric a distributed operating system for permissioned blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "scaling nakamoto consensus to thousands of transactions per second":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks")

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.DB(Databases)