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: "fixed dimensional energy games are in pseudo polynomial time"
  Abstract: We generalise the hyperplane separation technique Chatterjee and Velner, 2013 from multi-dimensional mean-payoff to energy games, and achieve an algorithm for solving the latter whose running time is exponential only in the dimension, but not in the number of vertices of the game graph. This answers an open question whether energy games with arbitrary initial credit can be solved in pseudo-polynomial time for fixed dimensionsi¾?3 or larger Chaloupka, 2013. It also improves the complexity of solving multi-dimensional energy games with given initial credit from non-elementary Brazdil, Janăi¾?ar, and Kuăi¾?era, 2010 to 2EXPTIME, thus establishing their 2EXPTIME-completeness.

Connected through hyperedge HE-1 (induced by source paper "games where you can play optimally with finite memory"):
  with members:
    - "concurrent games and semi random determinacy"
    - "extending finite memory determinacy by boolean combination of winning conditions"
    - "trading bounds for memory in games with counters"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "non zero sum games for reactive synthesis"
    - "first cycle games"
    - "looking at mean payoff and total payoff through windows"

Connected through hyperedge HE-2 (induced by source paper "deciding fast termination for probabilistic vass with nondeterminism"):
  with members:
    - "reachability in vector addition systems is primitive recursive in fixed dimension"
    - "the reachability problem for petri nets is not elementary"
    - "efficient algorithms for asymptotic bounds on termination time in vass"
    - "perfect half space games"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"
    - "complexity hierarchies beyond elementary"

Connected through hyperedge HE-3 (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"
    - "infinite state energy games"
    - "robust multidimensional mean payoff games are undecidable"
    - "solving parity games on integer vectors"

Connected through hyperedge HE-4 (induced by source paper "reachability games with relaxed energy constraints"):
  with members:
    - "bounding average energy games"
    - "average energy games"
    - "reachability in succinct one counter games"
    - "on the complexity of counter reachability games"
    - "reachability in two clock timed automata is pspace complete"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-5 (induced by source paper "efficient algorithms for asymptotic bounds on termination time in vass"):
  with members:
    - "perfect half space games"
    - "complexity hierarchies beyond elementary"
    - "liveness of parameterized timed networks"
    - "demystifying reachability in vector addition systems"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "the complexity of multi mean payoff and multi energy games"
    - "hyperplane separation technique for multidimensional mean payoff games"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-6 (induced by source paper "resource logics with a diminishing resource"):
  with members:
    - "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"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-7 (induced by source paper "parameterized games and parameterized automata"):
  with members:
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "the complexity of admissibility in omega regular games"
    - "efficient controller synthesis for consumption games with multiple resource types"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-8 (induced by source paper "perfect half space games"):
  with members:
    - "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"
    - "reachability games on extended vector addition systems with states"
    - "better quality in synthesis through quantitative objectives"

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)