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 "a delayed promotion policy for parity games"):
  Abstract: Parity games are two-player infinite-duration games on graphs that play a crucial role in various fields of theoretical computer science. Finding efficient algorithms to solve these games in practice is widely acknowledged as a core problem in formal verification, as it leads to efficient solutions of the model-checking and satisfiability problems of expressive temporal logics, e.g., the modal muCalculus. Their solution can be reduced to the problem of identifying sets of positions of the game, called dominions, in each of which a player can force a win by remaining in the set forever. Recently, a novel technique to compute dominions, called priority promotion, has been proposed, which is based on the notions of quasi dominion, a relaxed form of dominion, and dominion space. The underlying framework is general enough to accommodate different instantiations of the solution procedure, whose correctness is ensured by the nature of the space itself. In this paper we propose a new such instantiation, called delayed promotion, that tries to reduce the possible exponential behaviours exhibited by the original method in the worst case. The resulting procedure not only often outperforms the original priority promotion approach, but so far no exponential worst case is known.

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 "attracting tangles to solve parity games":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "simple fixpoint iteration to solve parity games")
  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 "parity games zielonka s algorithm in quasi polynomial time")
  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 "reasoning about strategies on the satisfiability problem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nash equilibrium and bisimulation invariance")
  Member "symmetric strategy improvement":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parity games with weights")
  Member "optimal strategy synthesis for request response games":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")

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)