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 "rationals vs byzantines in consensus based blockchains"):
  Abstract: In this paper we analyze from the game theory point of view Byzantine Fault Tolerant blockchains when processes exhibit rational or Byzantine behavior. Our work is the first to model the Byzantine-consensus based blockchains as a committee coordination game. Our first contribution is to offer a game-theoretical methodology to analyse equilibrium interactions between Byzantine and rational committee members in Byzantine Fault Tolerant blockchains. Byzantine processes seek to inflict maximum damage to the system, while rational processes best-respond to maximise their expected net gains. Our second contribution is to derive conditions under which consensus properties are satisfied or not in equilibrium. When the majority threshold is lower than the proportion of Byzantine processes, invalid blocks are accepted in equilibrium. When the majority threshold is large, equilibrium can involve coordination failures , in which no block is ever accepted. However, when the cost of accepting invalid blocks is large, there exists an equilibrium in which blocks are accepted iff they are valid.

Includes members:
  Member "hotstuff bft consensus in the lens of blockchain":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "blockchain abstract data type":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "appending atomically in byzantine distributed ledgers")
  Member "a game theoretic analysis of shard based permissionless blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "zero knowledge proof of identity sybil resistant anonymous authentication on permissionless blockchains and incentive compatible strictly dominant cryptocurrencies")
  Member "leader randomization signature free byzantine consensus for consortium blockchains":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tenderbake classical bft style consensus for public blockchains")
  Member "enhancing bitcoin security and performance with strong consistency via collective signing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "optimal selfish mining strategies in bitcoin":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "incentive analysis of bitcoin ng revisited")
  Member "bitcoin ng a scalable blockchain protocol":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "surface a practical blockchain consensus algorithm for real world networks")
  Member "bitcoin meets strong consistency":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the feasibility of sybil attacks in shard based permissionless blockchains")

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.DC(Distributed, Parallel, and Cluster Computing)