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: "stochastic limit average games are in exptime"
  Abstract: The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within $\epsilon$ in time exponential in a polynomial in the size of the game times polynomial in logarithmic in $\frac{1}{\epsilon}$, for all $\epsilon>0$.

Connected through hyperedge HE-1 (induced by source paper "ergodic mean payoff games for the analysis of attacks in crypto currencies"):
  with members:
    - "quantitative analysis of smart contracts"
    - "bitcoin s security model revisited"
    - "optimal selfish mining strategies in bitcoin"
    - "the complexity of ergodic mean payoff games"
    - "analysis of hashrate based double spending"
    - "the miner s dilemma"
    - "majority is not enough bitcoin mining is vulnerable"
    - "pareto curves for probabilistic model checking"

Connected through hyperedge HE-2 (induced by source paper "acceptable strategy profiles in stochastic games"):
  with members:
    - "exact algorithms for solving stochastic games"

Connected through hyperedge HE-3 (induced by source paper "a potential reduction algorithm for two person zero sum mean payoff stochastic games"):
  with members:
    - "the complexity of ergodic mean payoff games"

Connected through hyperedge HE-4 (induced by source paper "qualitative analysis of concurrent mean payoff games"):
  with members:
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "the value 1 problem under finite memory strategies for concurrent mean payoff games"
    - "what is decidable about partially observable markov decision processes with omega regular objectives"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "decidable problems for probabilistic automata on infinite words"
    - "partial observation stochastic games how to win when belief fails"
    - "qualitative reachability in stochastic bpa games"
    - "measuring and synthesizing systems in probabilistic environments"

Connected through hyperedge HE-5 (induced by source paper "the complexity of ergodic mean payoff games"):
  with members:
    - "exact algorithms for solving stochastic games"
    - "an exponential lower bound for the latest deterministic strategy iteration algorithms"
    - "solving simple stochastic games with few coin toss positions"
    - "the complexity of solving reachability games using value and strategy iteration"
    - "exponential lower bounds for policy iteration"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-6 (induced by source paper "the value 1 problem under finite memory strategies for concurrent mean payoff games"):
  with members:
    - "qualitative analysis of concurrent mean payoff games"
    - "decidable problems for probabilistic automata on infinite words"
    - "the complexity of solving reachability games using value and strategy iteration"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-7 (induced by source paper "a probabilistic algorithm to compute the real dimension of a semi algebraic set"):
  with members:
    - "exact algorithms for solving stochastic games"
    - "computing a nonnegative matrix factorization provably"
    - "bounding the radii of balls meeting every connected component of semi algebraic sets"

Connected through hyperedge HE-8 (induced by source paper "exact algorithms for solving stochastic games"):
  with members:
    - "the dmm bound multivariate aggregate separation bounds"
    - "the complexity of solving reachability games using value and strategy iteration"
    - "bounding the radii of balls meeting every connected component of semi algebraic sets"
    - "recursive concurrent stochastic games"

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)