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: "solving parity games on integer vectors"
  Abstract: We consider parity games on infinite graphs where configurations are represented by control-states and integer vectors. This framework subsumes two classic game problems: parity games on vector addition systems with states (vass) and multidimensional energy parity games. We show that the multidimensional energy parity game problem is inter-reducible with a subclass of single-sided parity games on vass where just one player can modify the integer counters and the opponent can only change control-states. Our main result is that the minimal elements of the upward-closed winning set of these single-sided parity games on vass are computable. This implies that the Pareto frontier of the minimal initial credit needed to win multidimensional energy parity games is also computable, solving an open question from the literature. Moreover, our main result implies the decidability of weak simulation preorder/equivalence between finite-state systems and vass, and the decidability of model checking vass with a large fragment of the modal mu-calculus.

Connected through hyperedge HE-1 (induced by source paper "energy mean payoff games"):
  with members:
    - "perfect half space games"
    - "computer aided synthesis a game theoretic approach"
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "on the complexity of heterogeneous multidimensional quantitative games"
    - "average energy games"
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "infinite state energy games"
    - "robust multidimensional mean payoff games are undecidable"

Connected through hyperedge HE-2 (induced by source paper "parameterized synthesis for fragments of first order logic over data words"):
  with members:
    - "synthesis of data word transducers"
    - "playing with repetitions in data words using energy games"
    - "bounded synthesis of register transducers"
    - "distributed synthesis for parameterized temporal logics"
    - "playing games in the baire space"
    - "automated synthesis of distributed controllers"
    - "optimal strategy synthesis for request response games"
    - "petri games synthesis of distributed systems with causal memory"

Connected through hyperedge HE-3 (induced by source paper "resource logics with a diminishing resource"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "alternating time temporal logic with finite memory strategies"
    - "model checking coalitional games in shortage resource scenarios"
    - "model checking atl under imperfect information and perfect recall semantics is undecidable"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-4 (induced by source paper "playing with repetitions in data words using energy games"):
  with members:
    - "perfect half space games"
    - "reasoning about data repetitions with counter systems"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "reachability games on extended vector addition systems with states"
    - "temporal logics on words with multiple data values"
    - "ltl with the freeze quantifier and register automata"

Connected through hyperedge HE-5 (induced by source paper "perfect half space games"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "secure equilibria in weighted games"
    - "the complexity of multi mean payoff and multi energy games"
    - "strategy synthesis for multi dimensional quantitative objectives"
    - "reachability games on extended vector addition systems with states"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-6 (induced by source paper "mdps with energy parity objectives"):
  with members:
    - "optimizing the expected mean payoff in energy markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "energy and mean payoff parity markov decision processes"
    - "energy parity games"
    - "better quality in synthesis through quantitative objectives"

Connected through hyperedge HE-7 (induced by source paper "optimizing the expected mean payoff in energy markov decision processes"):
  with members:
    - "an omega algebra for real time energy problems"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "qualitative analysis of vass induced mdps"
    - "average energy games"
    - "multidimensional beyond worst case and almost sure problems for mean payoff objectives"
    - "zero reachability in probabilistic multi counter automata"
    - "the odds of staying on budget"
    - "polynomial time algorithms for energy games with special weight structures"

Connected through hyperedge HE-8 (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"
    - "the complexity of robot games on the integer line"
    - "reachability games on extended vector addition systems with states"
    - "energy parity 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.LO(Logic in Computer Science)