human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "rational secret sharing and multiparty computation extended abstract"
  Abstract: We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that as few as possible of the other agents get it. We show that, under these assumptions, neither secret sharing nor multiparty function computation is possible using a mechanism that has a fixed running time. However, we show that both are possible using randomized mechanisms with constant expected running time.

Connected through hyperedge HE-1 (induced by source paper "sok tools for game theoretic models of security for cryptocurrencies"):
  with members:
    - "oceanic games centralization risks and incentives in blockchain mining"
    - "a survey on consensus mechanisms and mining strategy management in blockchain networks"
    - "selfish mining in ethereum"
    - "impossibility of full decentralization in permissionless blockchains"
    - "squirrl automating attack discovery on blockchain incentive mechanisms with deep reinforcement learning"
    - "an axiomatic approach to block rewards"
    - "reward sharing schemes for stake pools"
    - "compounding of wealth in proof of stake cryptocurrencies"

Connected through hyperedge HE-2 (induced by source paper "rational threshold cryptosystems"):
  with members:
    - "a scalable verification solution for blockchains"
    - "dfinity technology overview series consensus system"
    - "casper the friendly finality gadget"
    - "asicboost a speedup for bitcoin mining"
    - "optimal selfish mining strategies in bitcoin"
    - "majority is not enough bitcoin mining is vulnerable"

Connected through hyperedge HE-3 (induced by source paper "self stabilization through the lens of game theory"):
  with members:
    - "coordination games on directed graphs"
    - "efficient equilibria in polymatrix coordination games"
    - "self stabilizing uncoupled dynamics"
    - "petri games synthesis of distributed systems with causal memory"
    - "a classification of weakly acyclic games"
    - "computer science and game theory a brief survey"

Connected through hyperedge HE-4 (induced by source paper "secure voting protocols with perfect ballot secrecy"):
  with members:
    - "protecting privacy through distributed computation in multi agent decision making"
    - "complexity of manipulation bribery and campaign management in bucklin and fallback voting"
    - "equilibria of plurality voting with abstentions"
    - "universal voting protocol tweaks to make manipulation hard"

Connected through hyperedge HE-5 (induced by source paper "consensus in equilibrium can one against all decide fairly"):
  with members:
    - "the role of a priori information in networks of rational agents"
    - "reaching distributed equilibrium with limited id space"

Connected through hyperedge HE-6 (induced by source paper "sharing information with competitors"):
  with members:
    - "how to incentivize data driven collaboration among competing parties"
    - "a new approach to practical active secure two party computation"
    - "privacy aware mechanism design"

Connected through hyperedge HE-7 (induced by source paper "fair leader election for rational agents in asynchronous rings and networks"):
  with members:
    - "rational fair consensus in the gossip model"
    - "cheating by duplication equilibrium requires global knowledge"
    - "lower bounds on implementing robust and resilient mediators"

Connected through hyperedge HE-8 (induced by source paper "rational fair consensus in the gossip model"):
  with members:
    - "plurality consensus in the gossip model"
    - "global computation in a poorly connected world fast rumor spreading with no dependence on conductance"

Question: Please tell me which class the center node 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)