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: "the complexity of robot games on the integer line"
  Abstract: In robot games on Z, two players add integers to a counter. Each player has a finite set from which he picks the integer to add, and the objective of the first player is to let the counter reach 0. We present an exponential-time algorithm for deciding the winner of a robot game given the initial counter value, and prove a matching lower 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 "undecidability of two dimensional robot games"):
  with members:
    - "weighted automata on infinite words in the context of attacker defender games"
    - "reachability in succinct one counter games"
    - "on the complexity of counter reachability games"
    - "solving parity games on integer vectors"
    - "reachability games on extended vector addition systems with states"
    - "energy parity games"

Connected through hyperedge HE-3 (induced by source paper "weighted automata on infinite words in the context of attacker defender games"):
  with members:
    - "undecidability of two dimensional robot games"
    - "on the complexity of counter reachability games"
    - "infinite state games with finitary conditions"
    - "reachability games on extended vector addition systems with states"
    - "braid group cryptography"

Connected through hyperedge HE-4 (induced by source paper "reachability in succinct one counter games"):
  with members:
    - "on the complexity of counter reachability games"
    - "reachability in two clock timed automata is pspace complete"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-5 (induced by source paper "on the complexity of counter reachability games"):
  with members:
    - "reachability in succinct one counter games"
    - "reachability games on extended vector addition systems with states"
    - "model checking probabilistic timed automata with one or two clocks"

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.LO(Logic in Computer Science)