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 "optimally resilient strategies in pushdown safety games"):
  Abstract: Infinite-duration games with disturbances extend the classical framework of infinite-duration games, which captures the reactive synthesis problem, with a discrete measure of resilience against non-antagonistic disturbances, i.e., unmodeled situations in which the actual controller action differs from the intended one. For games played on finite arenas it is known that computing optimally resilient strategies only incurs a polynomial overhead over solving classical games. #R##N#This paper studies safety games with disturbances played on infinite arenas induced by pushdown systems. We show how to compute optimally resilient strategies in triply-exponential time. For the subclass of safety games played on one-counter configuration graphs, we show that determining the degree of resilience of the initial configuration is PSPACE-complete and that optimally resilient strategies can be computed in doubly-exponential time.

Includes members:
  Member "synthesizing optimally resilient controllers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free")
  Member "summaries for context free games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "domains for higher order games")
  Member "an automaton learning approach to solving safety games over infinite graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "quantitative games under failures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "synthesizing optimally resilient controllers")
  Member "robust linear temporal logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "elaborating on learned demonstrations with temporal logic specifications")
  Member "how to handle assumptions in synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "specification and reactive synthesis of robust controllers")
  Member "playing pushdown parity games in a hurry":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parity games another view on lehtinen s algorithm")
  Member "better quality in synthesis through quantitative objectives":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "imitation projected programmatic reinforcement learning")

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)