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 "quasipolynomial set based symbolic algorithms for parity games"):
  Abstract: Solving parity games, which are equivalent to modal $\mu$-calculus model checking, is a central algorithmic problem in formal methods. Besides the standard computation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with $n$ vertices and parity conditions with $d$ priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) an algorithm that requires $O(n^d)$ symbolic operations and $O(d)$ symbolic space; and (b) an improved algorithm that requires $O(n^{d/3+1})$ symbolic operations and $O(n)$ symbolic space. Our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and $O(n)$ symbolic space; and (b) any future improvement in progress measure based explicit algorithms imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and $O(d \cdot \log n)$ symbolic space. Moreover, for the important special case of $d \leq \log n$, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.

Includes members:
  Member "solving parity games using an automata based algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simple fixpoint iteration to solve parity games")
  Member "oink an implementation and evaluation of modern parity game solvers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "lower bounds for symbolic computation on graphs strongly connected components liveness safety and diameter":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "symbolic algorithms for graphs and markov decision processes with fairness objectives")
  Member "an ordered approach to solving parity games in quasi polynomial time and quasi linear space":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "a universal attractor decomposition algorithm for parity games")
  Member "winning cores in parity games":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "improved set based symbolic algorithms for parity games")
  Member "improved algorithms for one pair and k pair streett objectives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "near linear time algorithms for streett objectives in graphs and mdps")
  Member "generating and solving symbolic parity games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "oink an implementation and evaluation of modern parity game solvers")

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.GT(Computer Science and Game Theory)