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: "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.

Connected through hyperedge HE-1 (induced by source paper "optimally resilient strategies in pushdown safety games"):
  with members:
    - "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"
    - "playing pushdown parity games in a hurry"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-2 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free"):
  with members:
    - "robust expressive and quantitative linear temporal logics pick any two for free full version"
    - "robust expressive and quantitative linear temporal logics"
    - "robust linear temporal logic"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

Connected through hyperedge HE-3 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free full version"):
  with members:
    - "visibly linear dynamic logic"
    - "robust linear temporal logic"
    - "parametric linear dynamic logic"
    - "optimal bounds in parametric ltl games"

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)