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: "qualitative reachability in stochastic bpa games"
  Abstract: We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is specified by a regular set of target configurations and a qualitative probability constraint '>0' or '=1'. The goal of one player is to maximize the probability of reaching the target set so that the constraint is satisfied, while the other player aims at the opposite. We show that the winner in such games can be determined in P for the '>0' constraint, and in [email protected]?co-NP for the '=1' constraint. Further, we prove that the winning regions for both players are regular, and we design algorithms which compute the associated finite-state automata. Finally, we show that winning strategies can be synthesized effectively.

Connected through hyperedge HE-1 (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"
    - "the complexity of solving reachability games using value and strategy iteration"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-2 (induced by source paper "on strong determinacy of countable stochastic games"):
  with members:
    - "stochastic parity games on lossy channel systems"
    - "recursive concurrent stochastic games"

Connected through hyperedge HE-3 (induced by source paper "parity objectives in countable mdps"):
  with members:
    - "qualitative analysis of vass induced mdps"
    - "verifying nondeterministic probabilistic channel systems against ω regular linear time properties"

Connected through hyperedge HE-4 (induced by source paper "greatest fixed points of probabilistic min max polynomial equations and reachability for branching markov decision processes"):
  with members:
    - "analysis of probabilistic basic parallel processes"
    - "polynomial time algorithms for multi type branching processes and stochastic context free grammars"
    - "model checking stochastic branching processes"
    - "polynomial time algorithms for branching markov decision processes and probabilistic min max polynomial bellman equations"
    - "linear encodings of bounded ltl model checking"
    - "model checking probabilistic pushdown automata"

Connected through hyperedge HE-5 (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"
    - "measuring and synthesizing systems in probabilistic environments"
    - "the complexity of solving reachability games using value and strategy iteration"

Connected through hyperedge HE-6 (induced by source paper "hyperplane separation technique for multidimensional mean payoff games"):
  with members:
    - "undecidability of two dimensional robot games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "synthesis from ltl specifications with mean payoff objectives"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "the complexity of multi mean payoff and multi energy games"
    - "mean payoff pushdown games"
    - "the complexity of mean payoff automaton expression"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-7 (induced by source paper "solving stochastic b uchi games on infinite arenas with a finite attractor"):
  with members:
    - "the parametric ordinal recursive complexity of post embedding problems"
    - "determinacy in stochastic games with unbounded payoff functions"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "multiply recursive upper bounds with higman s lemma"
    - "one counter stochastic games"
    - "recursive concurrent stochastic games"
    - "on termination for faulty channel machines"
    - "verifying nondeterministic probabilistic channel systems against ω regular linear time properties"

Connected through hyperedge HE-8 (induced by source paper "determinacy in stochastic games with unbounded payoff functions"):
  with members:
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "approximating the termination value of one counter mdps and stochastic games"
    - "reachability games on extended vector addition systems with states"
    - "generalized mean payoff and energy games"
    - "one counter stochastic games"
    - "one counter markov decision processes"
    - "recursive concurrent stochastic games"
    - "on computing fixpoints in well structured regular model checking with applications to lossy channel systems"

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)