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 "synthesising strategy improvement and recursive algorithms for solving 2 5 player parity games"):
  Abstract: 2.5 player parity games combine the challenges posed by 2.5 player reachability games and the qualitative analysis of parity games. These two types of problems are best approached with different types of algorithms: strategy improvement algorithms for 2.5 player reachability games and recursive algorithms for the qualitative analysis of parity games. We present a method that - in contrast to existing techniques - tackles both aspects with the best suited approach and works exclusively on the 2.5 player game itself. The resulting technique is powerful enough to handle games with several million states.

Includes members:
  Member "symmetric strategy improvement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parity games with weights")
  Member "lazy probabilistic model checking without determinisation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "control synthesis from linear temporal logic specifications using model free reinforcement learning")
  Member "non oblivious strategy improvement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a parity game tale of two counters")
  Member "gist a solver for probabilistic games":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the challenges in specifying and explaining synthesized implementations of reactive systems")
  Member "solving simple stochastic games with few random vertices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of nash equilibria in simple stochastic multiplayer games")
  Member "relational parametricity for computational effects":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "infinitary combinatory reduction systems normalising reduction strategies")

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)