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: "energy parity games"
  Abstract: Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objective. Our main results are as follows: (a) exponential memory is necessary and sufficient for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP \cap coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is polynomially equivalent to the problem of deciding the winner in mean-payoff parity games, while optimal strategies may require infinite memory in mean-payoff parity games. As a consequence we obtain a conceptually simple algorithm to solve mean-payoff parity games.

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"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "first cycle games"

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 "resource aware automata and games for optimal synthesis"):
  with members:
    - "parity games with weights"
    - "a coalgebraic approach to quantitative linear time logics"
    - "decidability problems for actor systems"
    - "from branching to linear time coalgebraically"
    - "parity and streett games with costs"

Connected through hyperedge HE-5 (induced by source paper "stochastic shortest paths and weight bounded properties in markov decision processes"):
  with members:
    - "mdps with energy parity objectives"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "variations on the stochastic shortest path problem"
    - "the odds of staying on budget"
    - "computing quantiles in markov reward models"
    - "meet your expectations with guarantees beyond worst case synthesis in quantitative games"
    - "energy and mean payoff parity markov decision processes"

Connected through hyperedge HE-6 (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"
    - "generalized mean payoff and energy games"

Connected through hyperedge HE-7 (induced by source paper "a pseudo quasi polynomial algorithm for solving mean payoff parity games"):
  with members:
    - "parity games with weights"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "parity and streett games with costs"

Connected through hyperedge HE-8 (induced by source paper "comparator automata in quantitative verification"):
  with members:
    - "exact and approximate determinization of discounted sum automata"
    - "expressiveness and closure properties for quantitative languages"

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)