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 "don t mine wait in line fair and efficient blockchain consensus with robust round robin"):
  Abstract: Proof-of-Stake systems randomly choose, on each round, one of the participants as a consensus leader that extends the chain with the next block such that the selection probability is proportional to the owned stake. However, distributed random number generation is notoriously difficult. Systems that derive randomness from the previous blocks are completely insecure; solutions that provide secure random selection are inefficient due to their high communication complexity; and approaches that balance security and performance exhibit selection bias. When block creation is rewarded with new stake, even a minor bias can have a severe cumulative effect. #R##N#In this paper, we propose Robust Round Robin, a new consensus scheme that addresses this selection problem. We create reliable long-term identities by bootstrapping from an existing infrastructure, such as Intel's SGX processors, or by mining them starting from an initial fair distribution. For leader selection we use a deterministic approach. On each round, we select a set of the previously created identities as consensus leader candidates in round robin manner. Because simple round-robin alone is vulnerable to attacks and offers poor liveness, we complement such deterministic selection policy with a lightweight endorsement mechanism that is an interactive protocol between the leader candidates and a small subset of other system participants. Our solution has low good efficiency as it requires no expensive distributed randomness generation and it provides block creation fairness which is crucial in deployments that reward it with new stake.

Includes members:
  Member "dfinity technology overview series consensus system":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "consensus in the age of blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hushrelay a privacy preserving efficient and scalable routing algorithm for off chain payments")
  Member "software grand exposure sgx cache attacks are practical":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed systems and trusted execution environments trade offs and challenges")
  Member "malware guard extension using sgx to conceal cache attacks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "copycat controlled instruction level attacks on enclaves for maximal key extraction")
  Member "proof of luck an efficient blockchain consensus protocol":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the convergence of artificial intelligence and distributed ledger technology a scoping review and future research agenda")
  Member "algorand the efficient and democratic ledger":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "consistency of proof of stake blockchains with concurrent honest slot leaders")

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)