human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "model checking atl under imperfect information and perfect recall semantics is undecidable"
  Abstract: We propose a formal proof of the undecidability of the model checking problem for alternatingtime temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines.

Connected through hyperedge HE-1 (induced by source paper "sat based atl satisfiability checking"):
  with members:
    - "fixpoint approximation of strategic abilities under imperfect information"
    - "sat modulo monotonic theories"
    - "reasoning about knowledge and strategies epistemic strategy logic"
    - "the expressive power of epistemic μ calculus"
    - "a decidable fragment of strategy logic"

Connected through hyperedge HE-2 (induced by source paper "strategic abilities of asynchronous agents semantic paradoxes and how to tame them"):
  with members:
    - "mcmas slk a model checker for the verification of strategy logic specifications"

Connected through hyperedge HE-3 (induced by source paper "resource logics with a diminishing resource"):
  with members:
    - "fixed dimensional energy games are in pseudo polynomial time"
    - "how to be both rich and happy combining quantitative and qualitative strategic reasoning about multi player games extended abstract"
    - "solving parity games on integer vectors"
    - "alternating time temporal logic with finite memory strategies"
    - "model checking coalitional games in shortage resource scenarios"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-4 (induced by source paper "decidability results for atl with imperfect information and perfect recall"):
  with members:
    - "quantified ctl with imperfect information"
    - "hierarchical information patterns and distributed strategy synthesis"
    - "atlsc with partial observation"
    - "quantified ctl expressiveness and complexity"
    - "reasoning about strategies on the model checking problem"
    - "model checking an alternating time temporal logic with knowledge imperfect information perfect recall and communicating coalitions"

Connected through hyperedge HE-5 (induced by source paper "strategy logic with imperfect information"):
  with members:
    - "decidability results for atl with imperfect information and perfect recall"
    - "games on graphs with a public signal monitoring"
    - "the fixed initial credit problem for partial observation energy games is ack complete"
    - "hierarchical information and the synthesis of distributed strategies"
    - "hierarchical information patterns and distributed strategy synthesis"
    - "pure nash equilibria in concurrent deterministic games"
    - "atlsc with partial observation"
    - "games with a weak adversary"

Connected through hyperedge HE-6 (induced by source paper "dependences in strategy logic"):
  with members:
    - "nash equilibrium and bisimulation invariance"
    - "strategy logic with imperfect information"
    - "reasoning about strategies on the satisfiability problem"
    - "assume admissible synthesis"
    - "an epistemic strategy logic"
    - "mcmas slk a model checker for the verification of strategy logic specifications"
    - "reasoning about strategies on the model checking problem"
    - "on the expressiveness and complexity of atl"

Connected through hyperedge HE-7 (induced by source paper "a backward traversal based approach for symbolic model checking of uniform strategies for constrained reachability"):
  with members:
    - "decidability results for atl with imperfect information and perfect recall"
    - "safraless synthesis for epistemic temporal specifications"
    - "reasoning about strategies under partial observability and fairness constraints"
    - "algorithms for omega regular games with imperfect information"

Connected through hyperedge HE-8 (induced by source paper "fixpoint approximation of strategic abilities under imperfect information"):
  with members:
    - "model checking an alternating time temporal logic with knowledge imperfect information perfect recall and communicating coalitions"

Question: Please tell me which class the center node 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)