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 "competing semi selfish miners in bitcoin"):
  Abstract: The Bitcoin protocol prescribes certain behavior by the miners who are responsible for maintaining and extending the underlying blockchain; in particular, miners who successfully solve a puzzle, and hence can extend the chain by a block, are supposed to release that block immediately. Eyal and Sirer showed, however, that a selfish miner is incentivized to deviate from the protocol and withhold its blocks under certain conditions. #R##N#The analysis by Eyal and Sirer, as well as in followup work, considers a \emph{single} deviating miner (who may control a large fraction of the hashing power in the network) interacting with a remaining pool of honest miners. Here, we extend this analysis to the case where there are \emph{multiple} (non-colluding) selfish miners. We find that with multiple strategic miners, specific deviations from honest mining by multiple strategic agents can outperform honest mining, even if individually miners would not be incentivised to be dishonest. This previous point effectively renders the Bitcoin protocol to be less secure than previously thought.

Includes members:
  Member "blockchain mining games with pay forward":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fairness and efficiency in dag based cryptocurrencies")
  Member "a deep dive into blockchain selfish mining":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squirrl automating attack discovery on blockchain incentive mechanisms with deep reinforcement learning")
  Member "be selfish and avoid dilemmas fork after withholding faw attacks on bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "exploring the attack surface of blockchain a systematic overview")
  Member "blockchain mining games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the feasibility of sybil attacks in shard based permissionless blockchains")
  Member "optimal selfish mining strategies in bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "incentive analysis of bitcoin ng revisited")
  Member "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "on subversive miner strategies and block withholding attack in bitcoin digital currency":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (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.GT(Computer Science and Game Theory)