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: "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
  Abstract: Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their data structure as a progress measure, allowing for a backward implementation instead of a complete unravelling of the game. To achieve this, a number of changes have to be made to their techniques, where the main one is to add power to the antagonistic player that allows for determining her rational move without changing the outcome of the game. We provide a first implementation for a quasi-polynomial algorithm, test it on small examples, and provide a number of side results, including minor algorithmic improvements, a quasi bi-linear complexity in the number of states and edges for a fixed number of colours, and matching lower bounds for the algorithm of Calude et al.

Connected through hyperedge HE-1 (induced by source paper "parity games zielonka s algorithm in quasi polynomial time"):
  with members:
    - "oink an implementation and evaluation of modern parity game solvers"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "robust exponential worst cases for divide et impera algorithms for parity games"
    - "efficient parallel strategy improvement for parity games"
    - "a short proof of correctness of the quasi polynomial time algorithm for parity games"
    - "exponential lower bounds for policy iteration"

Connected through hyperedge HE-2 (induced by source paper "alternating weak automata from universal trees"):
  with members:
    - "a pseudo quasi polynomial algorithm for solving mean payoff parity games"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "parity games and universal graphs"
    - "succinct progress measures for solving parity games"
    - "lower bounds for complementation of omega automata via the full automata technique"

Connected through hyperedge HE-3 (induced by source paper "parity games another view on lehtinen s algorithm"):
  with members:
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "a short proof of correctness of the quasi polynomial time algorithm for parity games"
    - "playing pushdown parity games in a hurry"
    - "exponential lower bounds for policy iteration"

Connected through hyperedge HE-4 (induced by source paper "improving the complexity of parys recursive algorithm"):
  with members:
    - "parity games zielonka s algorithm in quasi polynomial time"
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "the complexity of mean payoff games using universal graphs"
    - "succinct progress measures for solving parity games"

Connected through hyperedge HE-5 (induced by source paper "an application of communication complexity kolmogorov complexity and extremal combinatorics to parity games"):
  with members:
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "succinct progress measures for solving parity games"
    - "communication complexity of promise problems and their applications to finite automata"

Connected through hyperedge HE-6 (induced by source paper "lower bounds on separation automata for parity games"):
  with members:
    - "universal trees grow inside separating automata quasi polynomial lower bounds for parity games"
    - "succinct progress measures for solving parity games"
    - "communication complexity of promise problems and their applications to finite automata"

Connected through hyperedge HE-7 (induced by source paper "quasipolynomial set based symbolic algorithms for parity games"):
  with members:
    - "solving parity games using an automata based algorithm"
    - "oink an implementation and evaluation of modern parity game solvers"
    - "lower bounds for symbolic computation on graphs strongly connected components liveness safety and diameter"
    - "succinct progress measures for solving parity games"
    - "winning cores in parity games"
    - "improved algorithms for one pair and k pair streett objectives"
    - "generating and solving symbolic parity games"
    - "the fixpoint iteration algorithm for parity games"

Connected through hyperedge HE-8 (induced by source paper "oink an implementation and evaluation of modern parity game solvers"):
  with members:
    - "efficient parallel strategy improvement for parity games"
    - "succinct progress measures for solving parity games"
    - "a delayed promotion policy for parity games"
    - "improvement in small progress measures"
    - "generating and solving symbolic parity games"
    - "benchmarks for parity games"
    - "zielonka s recursive algorithm dull weak and solitaire games and tighter bounds"
    - "non oblivious strategy improvement"

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)