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 "hopping proof and fee free pooled mining in blockchain"):
  Abstract: The pool-hopping attack casts down the expected profits of both the mining pool and honest miners in Blockchain. The mainstream countermeasures, namely PPS (pay-per-share) and PPLNS (pay-per-last-N-share), can hedge pool hopping, but pose a risk to the pool as well as the cost to miners. In this study, we apply the zero-determinant (ZD) theory to design a novel pooled mining which offers an incentive mechanism for motivating non-memorial and memorial evolutionary miners not to switch in pools strategically. In short, our hopping-proof pooled mining has three unique features: 1) fee-free. No fee is charged if the miner does not hop. 2) wide applicability. It can be employed in both prepaid and postpaid mechanisms. 3) fairness. Even the pool can dominate the game with any miner, he has to cooperate when the miner does not hop among pools. The fairness of our scheme makes it have long-term sustainability. To the best of our knowledge, we are the first to propose a hopping-proof pooled mining with the above three natures simultaneously. Both theoretical and experimental analyses demonstrate the effectiveness of our scheme.

Includes members:
  Member "a survey on consensus mechanisms and mining strategy management in blockchain networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "blockchain consensus algorithms a survey")
  Member "diversification across mining pools optimal mining strategies under pow":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zero knowledge proof of identity sybil resistant anonymous authentication on permissionless blockchains and incentive compatible strictly dominant cryptocurrencies")
  Member "countering selfish mining in blockchains":
    also connected through other hyperedges:
      (none)
  Member "evolutionary game for mining pool selection in blockchain networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on consensus mechanisms and mining strategy management in blockchain networks")
  Member "optimal selfish mining strategies in bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "incentive analysis of bitcoin ng revisited")
  Member "on subversive miner strategies and block withholding attack in bitcoin digital currency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exploring the attack surface of blockchain a systematic overview")
  Member "the miner s dilemma":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "majority is not enough bitcoin mining is vulnerable":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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.GT(Computer Science and Game Theory)