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 "can 100 machines agree"):
  Abstract: Agreement protocols have been typically deployed at small scale, e.g., using three to five machines. This is because these protocols seem to suffer from a sharp performance decay. More specifically, as the size of a deployment---i.e., degree of replication---increases, the protocol performance greatly decreases. There is not much experimental evidence for this decay in practice, however, notably for larger system sizes, e.g., beyond a handful of machines. #R##N#In this paper we execute agreement protocols on up to 100 machines and observe on their performance decay. We consider well-known agreement protocols part of mature systems, such as Apache ZooKeeper, etcd, and BFT-Smart, as well as a chain and a novel ring-based agreement protocol which we implement ourselves. #R##N#We provide empirical evidence that current agreement protocols execute gracefully on 100 machines. We observe that throughput decay is initially sharp (consistent with previous observations); but intriguingly---as each system grows beyond a few tens of replicas---the decay dampens. For chain- and ring-based replication, this decay is slower than for the other systems. The positive takeaway from our evaluation is that mature agreement protocol implementations can sustain out-of-the-box 300 to 500 requests per second when executing on 100 replicas on a wide-area public cloud platform. Chain- and ring-based replication can reach between 4K and 11K (up to 20x improvements) depending on the fault assumptions.

Includes members:
  Member "the consensus number of a cryptocurrency":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dynamic byzantine reliable broadcast technical report")
  Member "sbft a scalable and decentralized trust infrastructure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "expected linear round synchronization the missing link for linear byzantine smr")
  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 "sbft a scalable decentralized trust infrastructure for blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "heb hybrid expenditure blockchain")
  Member "a byzantine fault tolerant ordering service for the hyperledger fabric blockchain platform":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "baash enabling blockchain as a service on high performance computing systems")
  Member "revisiting fast practical byzantine fault tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "que sera consensus simple asynchronous agreement with private coins and threshold logical clocks")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "incremental consistency guarantees for replicated objects":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "acia not acid conditions properties and challenges")

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)