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: "playing pushdown parity games in a hurry"
  Abstract: We continue the investigation of finite-duration variants o f infinite-duration games by extending known results for games played on finite graphs to those playe d on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows us to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.

Connected through hyperedge HE-1 (induced by source paper "optimally resilient strategies in pushdown safety games"):
  with members:
    - "synthesizing optimally resilient controllers"
    - "summaries for context free games"
    - "an automaton learning approach to solving safety games over infinite graphs"
    - "quantitative games under failures"
    - "robust linear temporal logic"
    - "how to handle assumptions in synthesis"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-2 (induced by source paper "parity games another view on lehtinen s algorithm"):
  with members:
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "a short proof of correctness of the quasi polynomial time algorithm for parity games"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "exponential lower bounds for policy iteration"

Connected through hyperedge HE-3 (induced by source paper "bounding average energy games"):
  with members:
    - "undecidability of two dimensional robot games"
    - "limit your consumption finding bounds in average energy games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "reachability in succinct one counter games"
    - "reachability in two clock timed automata is pspace complete"
    - "looking at mean payoff and total payoff through windows"
    - "automated synthesis of reliable and efficient systems through game theory a case study"

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)