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: "reachability games on extended vector addition systems with states"
  Abstract: We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.

Connected through hyperedge HE-1 (induced by source paper "energy mean payoff games"):
  with members:
    - "perfect half space games"
    - "computer aided synthesis a game theoretic approach"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "infinite state energy games"
    - "robust multidimensional mean payoff games are undecidable"

Connected through hyperedge HE-2 (induced by source paper "parameterized synthesis for fragments of first order logic over data words"):
  with members:
    - "synthesis of data word transducers"
    - "playing with repetitions in data words using energy games"
    - "bounded synthesis of register transducers"
    - "distributed synthesis for parameterized temporal logics"
    - "playing games in the baire space"
    - "automated synthesis of distributed controllers"
    - "optimal strategy synthesis for request response games"
    - "petri games synthesis of distributed systems with causal memory"

Connected through hyperedge HE-3 (induced by source paper "long run average behavior of vector addition systems with states"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "nested weighted limit average automata of bounded width"
    - "average energy games"
    - "long run average behaviour of probabilistic vector addition systems"
    - "mixed integer quadratic programming is in np"

Connected through hyperedge HE-4 (induced by source paper "resource logics with a diminishing resource"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "solving parity games on integer vectors"
    - "alternating time temporal logic with finite memory strategies"
    - "model checking coalitional games in shortage resource scenarios"
    - "model checking atl under imperfect information and perfect recall semantics is undecidable"

Connected through hyperedge HE-5 (induced by source paper "playing with repetitions in data words using energy games"):
  with members:
    - "perfect half space games"
    - "reasoning about data repetitions with counter systems"
    - "solving parity games on integer vectors"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "temporal logics on words with multiple data values"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-6 (induced by source paper "perfect half space games"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "secure equilibria in weighted games"
    - "solving parity games on integer vectors"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "controlling a population"):
  with members:
    - "automatic analysis of expected termination time for population protocols"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "robust synchronization in markov decision processes"
    - "infinite synchronizing words for probabilistic automata erratum"

Connected through hyperedge HE-8 (induced by source paper "undecidability of two dimensional robot games"):
  with members:
    - "weighted automata on infinite words in the context of attacker defender games"
    - "reachability in succinct one counter games"
    - "on the complexity of counter reachability games"
    - "solving parity games on integer vectors"
    - "the complexity of robot games on the integer line"
    - "energy parity 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)