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: "oink an implementation and evaluation of modern parity game solvers"
  Abstract: Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, as they are widely believed to admit a polynomial solution, but so far no such algorithm is known. In recent years, a number of new algorithms and improvements to existing algorithms have been proposed. We implement a new and easy to extend tool Oink, which is a high-performance implementation of modern parity game algorithms. We further present a comprehensive empirical evaluation of modern parity game algorithms and solvers, both on real world benchmarks and randomly generated games. Our experiments show that our new tool Oink outperforms the current state-of-the art.

Connected through hyperedge HE-1 (induced by source paper "a universal attractor decomposition algorithm for parity games"):
  with members:
    - "practical synthesis of reactive systems from ltl specifications via parity games"
    - "improving the complexity of parys recursive algorithm"
    - "alternating weak automata from universal trees"
    - "computing nested fixpoints in quasipolynomial time"
    - "parity games zielonka s algorithm in quasi polynomial time"
    - "fixpoint games on continuous lattices"
    - "quasipolynomial set based symbolic algorithms for parity games"
    - "succinct progress measures for solving parity games"

Connected through hyperedge HE-2 (induced by source paper "simple fixpoint iteration to solve parity games"):
  with members:
    - "solving parity games using an automata based algorithm"
    - "a comparison of bdd based parity game solvers"
    - "a parity game tale of two counters"
    - "attracting tangles to solve parity games"
    - "succinct progress measures for solving parity games"
    - "benchmarks for parity games"
    - "the fixpoint iteration algorithm for parity games"

Connected through hyperedge HE-3 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis"):
  with members:
    - "bosy an experimentation framework for bounded synthesis"
    - "the 4th reactive synthesis competition syntcomp 2017 benchmarks participants results"
    - "efficient parallel strategy improvement for parity games"
    - "from ltl and limit deterministic b uchi automata to deterministic parity automata"
    - "an automaton learning approach to solving safety games over infinite graphs"
    - "from ltl to deterministic automata a safraless compositional approach"
    - "from nondeterministic b uchi and streett automata to deterministic parity automata"

Connected through hyperedge HE-4 (induced by source paper "parity games zielonka s algorithm in quasi polynomial time"):
  with members:
    - "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"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "exponential lower bounds for policy iteration"

Connected through hyperedge HE-5 (induced by source paper "partial solvers for generalized parity games"):
  with members:
    - "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results"
    - "partial solvers for parity games effective polynomial time composition"
    - "conditionally optimal algorithms for generalized buchi games"
    - "fatal attractors in parity games building blocks for partial solvers"

Connected through hyperedge HE-6 (induced by source paper "solving mean payoff games via quasi dominions"):
  with members:
    - "succinct progress measures for solving parity games"
    - "dynamic consistency of conditional simple temporal networks via mean payoff games a singly exponential time dc checking"
    - "using strategy improvement to stay alive"

Connected through hyperedge HE-7 (induced by source paper "a parity game tale of two counters"):
  with members:
    - "simple fixpoint iteration to solve parity games"
    - "solving parity games using an automata based algorithm"
    - "parity games zielonka s algorithm in quasi polynomial time"
    - "attracting tangles to solve parity games"
    - "robust exponential worst cases for divide et impera algorithms for parity games"
    - "efficient parallel strategy improvement for parity games"
    - "succinct progress measures for solving parity games"
    - "a delayed promotion policy for parity games"

Connected through hyperedge HE-8 (induced by source paper "quasipolynomial set based symbolic algorithms for parity games"):
  with members:
    - "solving parity games using an automata based algorithm"
    - "lower bounds for symbolic computation on graphs strongly connected components liveness safety and diameter"
    - "an ordered approach to solving parity games in quasi polynomial time and quasi linear space"
    - "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"

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)