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: "optimal bounds in parametric ltl games"
  Abstract: We consider graph games of infinite duration with winning conditions in parameterized linear temporal logic, where the temporal operators are equipped with variables for time bounds. In model checking such specifications were introduced as "PLTL" by Alur et al. and (in a different version called "PROMPT-LTL") by Kupferman et al.. #R##N#We present an algorithm to determine optimal variable valuations that allow a player to win a game. Furthermore, we show how to determine whether a player wins a game with respect to some, infinitely many, or all valuations. All our algorithms run in doubly-exponential time; so, adding bounded temporal operators does not increase the complexity compared to solving plain LTL games.

Connected through hyperedge HE-1 (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"
    - "synthesizing optimally resilient controllers"
    - "robust linear temporal logic"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "parametric linear dynamic logic"

Connected through hyperedge HE-2 (induced by source paper "robust expressive and quantitative linear temporal logics pick any two for free full version"):
  with members:
    - "synthesizing optimally resilient controllers"
    - "visibly linear dynamic logic"
    - "robust linear temporal logic"
    - "parametric linear dynamic logic"

Connected through hyperedge HE-3 (induced by source paper "games with costs and delays"):
  with members:
    - "how much lookahead is needed to win infinite games"
    - "easy to win hard to master optimal strategies in parity games with costs"
    - "what are strategies in delay games borel determinacy for games with lookahead"
    - "delay games with wmso u winning conditions"
    - "parity and streett games with costs"
    - "degrees of lookahead in regular infinite games"
    - "weak mso with the unbounding quantifier"

Connected through hyperedge HE-4 (induced by source paper "distributed synthesis for parameterized temporal logics"):
  with members:
    - "encodings of bounded synthesis"
    - "distributed prompt ltl synthesis"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "detecting unrealizability of distributed fault tolerant systems"
    - "assume guarantee synthesis for concurrent reactive programs with partial information"
    - "parametric linear dynamic logic"

Connected through hyperedge HE-5 (induced by source paper "the reactive synthesis competition syntcomp 2016 and beyond"):
  with members:
    - "solving qbf by abstraction"
    - "the first reactive synthesis competition syntcomp 2014"
    - "satisfiability based methods for reactive synthesis from safety specifications"
    - "the 3rd reactive synthesis competition syntcomp 2016 benchmarks participants results"
    - "a high level ltl synthesis format tlsf v1 1"
    - "specification format for reactive synthesis problems"
    - "the second reactive synthesis competition syntcomp 2015"
    - "compositional algorithms for succinct safety games"

Connected through hyperedge HE-6 (induced by source paper "easy to win hard to master optimal strategies in parity games with costs"):
  with members:
    - "first cycle games"
    - "optimal strategy synthesis for request response games"
    - "parametric linear dynamic logic"
    - "parity and streett games with costs"

Connected through hyperedge HE-7 (induced by source paper "approximating optimal bounds in prompt ltl realizability in doubly exponential time"):
  with members:
    - "encodings of bounded synthesis"
    - "parameterized linear temporal logics meet costs still not costlier than ltl"
    - "parametric linear dynamic logic"

Connected through hyperedge HE-8 (induced by source paper "markov chains and unambiguous b uchi automata"):
  with members:
    - "from ltl to deterministic automata a safraless compositional approach"
    - "model checking markov chains against unambiguous buchi automata"
    - "two variable vs linear temporal logic in model checking and 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)