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: "parity and streett games with costs"
  Abstract: We consider two-player games played on finite graphs equipped with costs on edges and introduce two winning conditions, cost-parity and cost-Streett, which require bounds on the cost between requests and their responses. Both conditions generalize the corresponding classical omega-regular conditions and the corresponding finitary conditions. For parity games with costs we show that the first player has positional winning strategies and that determining the winner lies in NP and coNP. For Streett games with costs we show that the first player has finite-state winning strategies and that determining the winner is EXPTIME-complete. The second player might need infinite memory in both games. Both types of games with costs can be solved by solving linearly many instances of their classical variants.

Connected through hyperedge HE-1 (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"
    - "energy parity games"

Connected through hyperedge HE-2 (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"
    - "energy parity games"

Connected through hyperedge HE-3 (induced by source paper "synthesizing optimally resilient controllers"):
  with members:
    - "oink an implementation and evaluation of modern parity game solvers"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "succinct progress measures for solving parity games"
    - "quantitative games under failures"
    - "robust linear temporal logic"
    - "how to handle assumptions in synthesis"
    - "energy parity games"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-4 (induced by source paper "games with costs and delays"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "degrees of lookahead in regular infinite games"
    - "optimal bounds in parametric ltl games"
    - "weak mso with the unbounding quantifier"

Connected through hyperedge HE-5 (induced by source paper "quantitative reductions and vertex ranked infinite games full version"):
  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"
    - "down the borel hierarchy solving muller games via safety games"
    - "playing muller games in a hurry"
    - "energy parity games"

Connected through hyperedge HE-6 (induced by source paper "extending finite memory determinacy general techniques and an application to energy parity games"):
  with members:
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "first cycle games"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "multiplayer cost games with simple nash equilibria"
    - "synthesis of succinct systems"
    - "energy parity games"

Connected through hyperedge HE-7 (induced by source paper "extending finite memory determinacy to multiplayer games"):
  with members:
    - "extending finite memory determinacy general techniques and an application to energy parity games"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "infinite sequential games with real valued payoffs"
    - "weihrauch degrees of finding equilibria in sequential games"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "the complexity of multi mean payoff and multi energy games"
    - "multiplayer cost games with simple nash equilibria"
    - "energy parity games"

Connected through hyperedge HE-8 (induced by source paper "window parity games an alternative approach toward parity games with time bounds"):
  with members:
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "looking at mean payoff and total payoff through windows"
    - "infinite state games with finitary conditions"
    - "automated synthesis of reliable and efficient systems through game theory a case study"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "the surprizing complexity of generalized reachability 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.LO(Logic in Computer Science)