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 "probabilistic smart contracts secure randomness on the blockchain"):
  Abstract: In today's programmable blockchains, smart contracts are limited to being deterministic and non-probabilistic. This lack of randomness is a consequential limitation, given that a wide variety of real-world financial contracts, such as casino games and lotteries, depend entirely on randomness. As a result, several ad-hoc random number generation approaches have been developed to be used in smart contracts. These include ideas such as using an oracle or relying on the block hash. However, these approaches are manipulatable, i.e. their output can be tampered with by parties who might not be neutral, such as the owner of the oracle or the miners. We propose a novel game-theoretic approach for generating provably unmanipulatable pseudorandom numbers on the blockchain. Our approach allows smart contracts to access a trustworthy source of randomness that does not rely on potentially compromised miners or oracles, hence enabling the creation of a new generation of smart contracts that are not limited to being non-probabilistic and can be drawn from the much more general class of probabilistic programs.

Includes members:
  Member "quantitative analysis of smart contracts":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "targeted greybox fuzzing with static lookahead analysis")
  Member "computational approaches for stochastic shortest path on succinct mdps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "when can a distributed ledger replace a trusted third party":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a review on the application of blockchain for the next generation of cybersecure industry 4 0 smart factories")
  Member "securify practical security analysis of smart contracts":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview on smart contracts challenges advances and platforms")
  Member "ergodic mean payoff games for the analysis of attacks in crypto currencies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on applications of game theory in blockchain")
  Member "cantor meets scott semantic foundations for probabilistic networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards verified stochastic variational inference for probabilistic programs")
  Member "termination analysis of probabilistic programs through positivstellensatz s":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "reasoning about recursive probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "tail bound analysis for probabilistic programs via central moments")

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)