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 "synthesizing optimally resilient controllers"):
  Abstract: Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances. In this extended framework, one is interested in computing optimally resilient strategies, i.e., strategies that are resilient against as many disturbances as possible. Dallal, Neider, and Tabuada showed how to compute such strategies for safety specifications. #R##N#In this work, we compute optimally resilient strategies for a much wider range of winning conditions and show that they do not require more memory than winning strategies in the classical model. Our algorithms only have a polynomial overhead in comparison to the ones computing winning strategies. In particular, for parity conditions, optimally resilient strategies are positional and can be computed in quasipolynomial time.

Includes members:
  Member "oink an implementation and evaluation of modern parity game solvers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  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 "quantitative games under failures":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimally resilient strategies in pushdown safety games")
  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 "optimally resilient strategies in pushdown safety games")
  Member "parity and streett games with costs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "resource aware automata and games for optimal synthesis")
  Member "energy parity games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "games where you can play optimally with finite memory")

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)