human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "finite state strategies in delay games full version"):
  Abstract: What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question by presenting a very general framework that allows to remove delay: finite-state strategies exist for all winning conditions where the resulting delay-free game admits a finite-state strategy. The framework is applicable to games whose winning condition is recognized by an automaton with an acceptance condition that satisfies a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all previous results of that kind as special cases of our uniform approach.

Includes members:
  Member "games with costs and delays":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of transducer synthesis from multi sequential specifications")
  Member "an ordered approach to solving parity games in quasi polynomial time and quasi linear space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parity games zielonka s algorithm in quasi polynomial time")
  Member "succinct progress measures for solving parity games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "finite state strategies in delay games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of transducer synthesis from multi sequential specifications")
  Member "easy to win hard to master optimal strategies in parity games with costs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantitative reductions and vertex ranked infinite games")
  Member "extending finite memory determinacy to multiplayer games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "computer aided synthesis a game theoretic approach")
  Member "what are strategies in delay games borel determinacy for games with lookahead":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "finite state strategies in delay games")
  Member "delay games with wmso u winning conditions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "security aware synthesis using delayed action games")

Question: Please tell me which class the source paper 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)