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 "continuous time analysis of the bitcoin and prism backbone protocols"):
  Abstract: Bitcoin is a peer-to-peer payment system proposed by Nakamoto in 2008. Based on the Nakamoto consensus, Bagaria, Kannan, Tse, Fanti, and Viswanath proposed the Prism protocol in 2018 and showed that it achieves near-optimal blockchain throughput while maintaining similar level of security as bitcoin. This work provides the probabilistic guarantees for the liveliness and consistency of bitcoin and Prism transactions. Previous analyses of the bitcoin and Prism have been either established under a simplified discrete-time model or expressed in terms of exponential order result. This paper presents a streamlined and strengthened analysis under a more realistic continuous-time model where the block propagation delays are heterogeneous, arbitrary, and upper bounded by some constant. The goal is to show that every valid transaction becomes permanent in all honest miners' blockchains under a certain "typical event", which occurs with probability close to 1. To that end, we establish the blockchain growth theorem, the blockchain quality theorem, and the common prefix theorem. In lieu of exponential order result in the literature, the probabilistic guarantees for the desired properties of the bitcoin and Prism protocols take the form of explicit expressions here, which provide improved design references for public transaction ledger protocols.

Includes members:
  Member "on analysis of the bitcoin and prism backbone protocols":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proof of stake longest chain protocols revisited")
  Member "deconstructing the blockchain to approach physical limits":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "scaling nakamoto consensus to thousands of transactions per second":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "the balance attack against proof of work blockchains the r3 testbed as an example":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on analysis of the bitcoin and prism backbone protocols")
  Member "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.CR(Cryptography and Security)