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 "pnyxdb a lightweight leaderless democratic byzantine fault tolerant replicated datastore"):
  Abstract: Byzantine-Fault-Tolerant (BFT) systems are rapidly emerging as a viable technology for production-grade systems, notably in closed consortia deployments for nancial and supply-chain applications. Unfortunately, most algorithms proposed so far to coordinate these systems suffer from substantial scalability issues, and lack important features to implement Internet-scale governance mechanisms. In this paper, we observe that many application workloads offer little concurrency, and propose PnyxDB, an eventually-consistent Byzantine Fault Tolerant replicated datastore that exhibits both high scalability and low latency. Our approach is based on conditional endorsements, that allow nodes to specify the set of transactions that must not be committed for the endorsement to be valid. In addition to its high scalability, PnyxDB supports application-level voting, i.e. individual nodes are able to endorse or reject a transaction according to application-defined policies without compromising consistency. We provide a comparison against BFTSMaRt and Tendermint, two competitors with different design aims, and show that our implementation speeds up commit latencies by a factor of 11, remaining below 5 seconds in a worldwide geodistributed deployment of 180 nodes.

Includes members:
  Member "scalable and probabilistic leaderless bft consensus through metastability":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "blockclique scaling blockchains through transaction sharding in a multithreaded block graph")
  Member "flexible byzantine fault tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "in search for a linear byzantine agreement")
  Member "streamchain do blockchains need blocks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "decentralized applications the blockchain empowered software system":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "testimonium a cost efficient blockchain relay")
  Member "consensus in the age of blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "a byzantine fault tolerant ordering service for the hyperledger fabric blockchain platform":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "baash enabling blockchain as a service on high performance computing systems")
  Member "exploiting commutativity for practical fast replication":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hermes a fast fault tolerant and linearizable replication protocol")

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)