human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "efficient parallel strategy improvement for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "an ordered approach to solving parity games in quasi polynomial time and quasi linear space":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parity games zielonka s algorithm in quasi polynomial time")
  Member "succinct progress measures for solving parity games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "a delayed promotion policy for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a parity game tale of two counters")
  Member "improvement in small progress measures":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "attracting tangles to solve parity games")
  Member "generating and solving symbolic parity games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quasipolynomial set based symbolic algorithms for parity games")
  Member "benchmarks for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "simple fixpoint iteration to solve parity games")
  Member "zielonka s recursive algorithm dull weak and solitaire games and tighter bounds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a parity game tale of two counters")

Question: Please tell me which class the source paper 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)