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 "reachability games in dynamic epistemic logic"):
  Abstract: We define reachability games based on Dynamic Epistemic Logic (DEL), where the players' actions are finely described as DEL action models. We first consider the setting where an external controller with perfect information interacts with an environment and aims at reaching some epistemic goal state regarding the passive agents of the system. We study the problem of strategy existence for the controller, which generalises the classic epistemic planning problem, and we solve it for several types of actions such as public announcements and public actions. We then consider a yet richer setting where agents themselves are players, whose strategies must be based on their observations. We establish several (un)decidability results for the problem of existence of a distributed strategy, depending on the type of actions the players can use, and relate them to results from the literature on multiplayer games with imperfect information.

Includes members:
  Member "reasoning about knowledge and strategies under hierarchical information":
    also connected through other hyperedges:
      (none)
  Member "cooperative epistemic multi agent planning for implicit coordination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "what you get is what you see decomposing epistemic planning using functional strips")
  Member "games on graphs with a public signal monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nash equilibria in games over graphs equipped with a communication mechanism")
  Member "hanabi is np complete even for cheaters who look at their cards":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "np completeness of the game kingdomino")
  Member "hanabi is np hard even for cheaters who look at their cards":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the hanabi challenge a new frontier for ai research")
  Member "hierarchical information and the synthesis of distributed strategies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "synthesis in presence of dynamic links")
  Member "automata techniques for epistemic protocol synthesis":
    also connected through other hyperedges:
      (none)
  Member "the computational complexity of probabilistic planning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a rate distortion framework for explaining neural network decisions")

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)