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 "selfish mining in ethereum"):
  Abstract: We study selfish mining in Ethereum. The problem is combinato-rially more complex than in Bitcoin because of major differences in the reward system and a different difficulty adjustment formula. Equivalent strategies in Bitcoin do have different profitabilities in Ethereum. The attacker can either broadcast his fork one block by one, or keep them secret as long as possible and publish them all at once at the end of an attack cycle. The first strategy is damaging for substantial hashrates, and we show that the second strategy is even worse. This confirms what we already proved for Bitcoin: Selfish mining is most of all an attack on the difficulty adjustment formula. We show that the current reward for signaling uncle blocks is a weak incentive for the attacker to signal blocks. We compute the profitabilities of different strategies and find out that for a large parameter space values, strategies that do not signal blocks are the best ones. We compute closed-form formulas for the apparent hashrates for these strategies and compare them. We use a direct combinatorics analysis with Dyck words to find these closed-form formulas.

Includes members:
  Member "selfish mining in ethereum":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey on ethereum systems security vulnerabilities attacks and defenses")
  Member "bitcoin selfish mining and dyck words":
    also connected through other hyperedges:
      (none)
  Member "selfish mining and dyck words in bitcoin and ethereum networks":
    also connected through other hyperedges:
      (none)
  Member "on profitability of selfish mining":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on profitability of nakamoto double spend")
  Member "on profitability of trailing mining":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on profitability of nakamoto double spend")
  Member "the impact of uncle rewards on selfish mining in ethereum":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on ethereum systems security vulnerabilities attacks and defenses")
  Member "majority is not enough bitcoin mining is vulnerable":
    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")

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)