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: "two player reachability price games on single clock timed automata"
  Abstract: We study two player reachability-price games on single-clock timed automata. The problem is as follows: given a state of the automaton, determine whether the first player can guarantee reaching one of the designated goal locations. If a goal location can be reached then we also want to compute the optimum price of doing so. Our contribution is twofold. First, we develop a theory of cost functions, which provide a comprehensive methodology for the analysis of this problem. This theory allows us to establish our second contribution, an EXPTIME algorithm for computing the optimum reachability price, which improves the existing 3EXPTIME upper bound.

Connected through hyperedge HE-1 (induced by source paper "quantitative aspects of programming languages and systems over the past 2 4 years and beyond"):
  with members:
    - "paws a tool for the analysis of weighted systems"
    - "divide and conquer variable set separation in hybrid systems reachability analysis"
    - "logical characterization of trace metrics"
    - "design and optimisation of the flyfast front end for attribute based coordination"
    - "language based abstractions for dynamical systems"
    - "limit your consumption finding bounds in average energy games"
    - "mela modelling in ecology with location attributes"
    - "logical characterization of bisimulation metrics"

Connected through hyperedge HE-2 (induced by source paper "one clock priced timed games are pspace hard"):
  with members:
    - "simple priced timed games are not that simple"
    - "adding negative prices to priced timed games"
    - "a faster algorithm for solving one clock priced timed games"
    - "reachability time games on timed automata"

Connected through hyperedge HE-3 (induced by source paper "optimal reachability in divergent weighted timed games"):
  with members:
    - "simple priced timed games are not that simple"
    - "adding negative prices to priced timed games"
    - "to reach or not to reach efficient algorithms for total payoff games"
    - "a faster algorithm for solving one clock priced timed games"
    - "reachability time games on timed automata"

Connected through hyperedge HE-4 (induced by source paper "simple priced timed games are not that simple"):
  with members:
    - "adding negative prices to priced timed games"
    - "to reach or not to reach efficient algorithms for total payoff games"
    - "a faster algorithm for solving one clock priced timed games"

Connected through hyperedge HE-5 (induced by source paper "adding negative prices to priced timed games"):
  with members:
    - "a faster algorithm for solving one clock priced timed games"

Connected through hyperedge HE-6 (induced by source paper "a faster algorithm for solving one clock priced timed games"):
  with members:
    - "reachability time games on timed automata"

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)