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: "generalized mean payoff and energy games"
  Abstract: In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always nonnegative. Generalized mean-payoff and energy games replace individual weights by tuples, and the limit average (resp. running sum) of each coordinate must be (resp. remain) nonnegative. These games have applications in the synthesis of resource-bounded processes with multiple resources. #R##N#We prove the finite-memory determinacy of generalized energy games and show the inter-reducibility of generalized mean-payoff and energy games for finite-memory strategies. We also improve the computational complexity for solving both classes of games with finite-memory strategies: while the previously best known upper bound was EXPSPACE, and no lower bound was known, we give an optimal coNP-complete bound. For memoryless strategies, we show that the problem of deciding the existence of a winning strategy for the protagonist is NP-complete.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "reachability games with relaxed energy constraints"):
  with members:
    - "bounding average energy games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "quantitative reductions and vertex ranked infinite games"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "window parity games an alternative approach toward parity games with time bounds"
    - "average energy games"
    - "parametric linear dynamic logic"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "the complexity of multi mean payoff and multi energy games"
    - "measuring permissiveness in parity games mean payoff parity games revisited"
    - "energy parity 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"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "parameterized games and parameterized automata"):
  with members:
    - "admissibility in quantitative graph games"
    - "assume admissible synthesis"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "the complexity of admissibility in omega regular games"
    - "efficient controller synthesis for consumption games with multiple resource types"

Connected through hyperedge HE-7 (induced by source paper "robust exponential worst cases for divide et impera algorithms for parity games"):
  with members:
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "benchmark graphs for practical graph isomorphism"
    - "succinct progress measures for solving parity games"
    - "reasoning about strategies on the satisfiability problem"
    - "a delayed promotion policy for parity games"
    - "reasoning about strategies on the model checking problem"

Connected through hyperedge HE-8 (induced by source paper "optimizing the expected mean payoff in energy markov decision processes"):
  with members:
    - "an omega algebra for real time energy problems"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "average energy games"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "zero reachability in probabilistic multi counter automata"
    - "the odds of staying on budget"
    - "polynomial time algorithms for energy games with special weight structures"

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.LO(Logic in Computer Science)