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: "recursive concurrent stochastic games"
  Abstract: We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent#N#analysis of recursive simple stochastic games to a concurrent setting where the#N#two players choose moves simultaneously and independently at each state. For#N#multi-exit games, our earlier work already showed undecidability for basic#N#questions like termination, thus we focus on the important case of single-exit#N#RCSGs (1-RCSGs).#N#  We first characterize the value of a 1-RCSG termination game as the least#N#fixed point solution of a system of nonlinear minimax functional equations, and#N#use it to show PSPACE decidability for the quantitative termination problem. We#N#then give a strategy improvement technique, which we use to show that player 1#N#(maximizer) has \epsilon-optimal randomized Stackless & Memoryless (r-SM)#N#strategies for all \epsilon > 0, while player 2 (minimizer) has optimal r-SM#N#strategies. Thus, such games are r-SM-determined. These results mirror and#N#generalize in a strong sense the randomized memoryless determinacy results for#N#finite stochastic games, and extend the classic Hoffman-Karp strategy#N#improvement approach from the finite to an infinite state setting. The proofs#N#in our infinite-state setting are very different however, relying on subtle#N#analytic properties of certain power series that arise from studying 1-RCSGs.#N#  We show that our upper bounds, even for qualitative (probability 1)#N#termination, can not be improved, even to NP, without a major breakthrough, by#N#giving two reductions: first a P-time reduction from the long-standing#N#square-root sum problem to the quantitative termination decision problem for#N#finite concurrent stochastic games, and then a P-time reduction from the latter#N#problem to the qualitative termination problem for 1-RCSGs.

Connected through hyperedge HE-1 (induced by source paper "how good is a strategy in a game with nature"):
  with members:
    - "counting branches in trees using games"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-2 (induced by source paper "stopping criteria for value and strategy iteration on concurrent stochastic reachability games"):
  with members:
    - "sound value iteration"
    - "a storm is coming a modern probabilistic model checker"
    - "verification of markov decision processes using learning algorithms"
    - "strategy improvement for concurrent reachability and safety games"
    - "termination criteria for solving concurrent safety and reachability games"

Connected through hyperedge HE-3 (induced by source paper "reachability for branching concurrent stochastic games"):
  with members:
    - "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes"
    - "on the problem of computing the probability of regular sets of trees"
    - "analysis of probabilistic basic parallel processes"
    - "model checking stochastic branching processes"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"
    - "qualitative reachability in stochastic bpa games"
    - "the complexity of solving reachability games using value and strategy iteration"

Connected through hyperedge HE-4 (induced by source paper "on strong determinacy of countable stochastic games"):
  with members:
    - "stochastic parity games on lossy channel systems"
    - "qualitative reachability in stochastic bpa games"

Connected through hyperedge HE-5 (induced by source paper "stochastic parity games on lossy channel systems"):
  with members:
    - "solving stochastic b uchi games on infinite arenas with a finite attractor"
    - "verifying nondeterministic probabilistic channel systems against ω regular linear time properties"
    - "decisive markov chains"
    - "the existential theory of equations with rational constraints in free groups is pspace complete"

Connected through hyperedge HE-6 (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-7 (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"
    - "stochastic limit average games are in exptime"

Connected through hyperedge HE-8 (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"
    - "stochastic limit average games are in exptime"

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)