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 "parity games zielonka s algorithm in quasi polynomial time"):
  Abstract: Calude, Jain, Khoussainov, Li, and Stephan (2017) proposed a quasi-polynomial-time algorithm solving parity games. After this breakthrough result, a few other quasi-polynomial-time algorithms were introduced; none of them is easy to understand. Moreover, it turns out that in practice they operate very slowly. On the other side there is the Zielonka's recursive algorithm, which is very simple, exponential in the worst case, and the fastest in practice. We combine these two approaches: we propose a small modification of the Zielonka's algorithm, which ensures that the running time is at most quasi-polynomial. In effect, we obtain a simple algorithm that solves parity games in quasi-polynomial time. We also hope that our algorithm, after further optimizations, can lead to an algorithm that shares the good performance of the Zielonka's algorithm on typical inputs, while reducing the worst-case complexity on difficult inputs.

Includes members:
  Member "oink an implementation and evaluation of modern parity game solvers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "universal trees grow inside separating automata quasi polynomial lower bounds for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the strahler number of a parity game")
  Member "robust exponential worst cases for divide et impera algorithms for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "register games")
  Member "efficient parallel strategy improvement for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "semantic labelling and learning for parity game solving in ltl synthesis")
  Member "a short proof of correctness of the quasi polynomial time algorithm for parity games":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parity games another view on lehtinen s algorithm")
  Member "an ordered approach to solving parity games in quasi polynomial time and quasi linear space":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "alternating weak automata from universal trees")
  Member "exponential lower bounds for policy iteration":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a universal attractor decomposition algorithm for parity games")

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.FL(Formal Languages and Automata Theory)