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 "delay games with wmso u winning conditions"):
  Abstract: Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. We consider delay games with winning conditions expressed in weak monadic second order logic with the unbounding quantifier, which is able to express (un)boundedness properties. We show that it is decidable whether the delaying player has a winning strategy using bounded lookahead and give a doubly-exponential upper bound on the necessary lookahead. In contrast, we show that bounded lookahead is not always sufficient to win such a game.

Includes members:
  Member "how much lookahead is needed to win infinite games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of transducer synthesis from multi sequential specifications")
  Member "the mso u theory of n is undecidable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "mso nabla is undecidable")
  Member "what are strategies in delay games borel determinacy for games with lookahead":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "finite state strategies in delay games")
  Member "proceedings fifth international symposium on games automata logics and formal verification":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "synthesis of deterministic top down tree transducers from automatic tree relations")
  Member "synthesis of deterministic top down tree transducers from automatic tree relations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "logics for word transductions with synthesis")
  Member "parametric linear dynamic logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "promptness and bounded fairness in concurrent and parameterized systems")
  Member "weak mso u with path quantifiers over infinite trees":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "recursion schemes the mso logic and the u quantifier")
  Member "parity and streett games with costs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resource aware automata and games for optimal synthesis")

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)