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: "satisfiability games for branching time logics"
  Abstract: The satisfiability problem for branching-time temporal logics like CTL*, CTL#N#and CTL+ has important applications in program specification and verification.#N#Their computational complexities are known: CTL* and CTL+ are complete for#N#doubly exponential time, CTL is complete for single exponential time. Some#N#decision procedures for these logics are known; they use tree automata,#N#tableaux or axiom systems. In this paper we present a uniform game-theoretic#N#framework for the satisfiability problem of these branching-time temporal#N#logics. We define satisfiability games for the full branching-time temporal#N#logic CTL* using a high-level definition of winning condition that captures the#N#essence of well-foundedness of least fixpoint unfoldings. These winning#N#conditions form formal languages of \omega-words. We analyse which kinds of#N#deterministic {\omega}-automata are needed in which case in order to recognise#N#these languages. We then obtain a reduction to the problem of solving parity or#N#B\"uchi games. The worst-case complexity of the obtained algorithms matches the#N#known lower bounds for these logics. This approach provides a uniform, yet#N#complexity-theoretically optimal treatment of satisfiability for branching-time#N#temporal logics. It separates the use of temporal logic machinery from the use#N#of automata thus preserving a syntactical relationship between the input#N#formula and the object that represents satisfiability, i.e. a winning strategy#N#in a parity or B\"uchi game. The games presented here work on a Fischer-Ladner#N#closure of the input formula only. Last but not least, the games presented here#N#come with an attempt at providing tool support for the satisfiability problem#N#of complex branching-time logics like CTL* and CTL+.

Connected through hyperedge HE-1 (induced by source paper "optimal satisfiability checking for arithmetic mu calculi"):
  with members:
    - "permutation games for the weakly aconjunctive mu calculus"
    - "unifying buchi complementation constructions"
    - "exptime tableaux for the coalgebraic mu calculus"
    - "strong completeness of coalgebraic modal logics"
    - "pspace bounds for rank 1 modal logics"
    - "decisive markov chains"

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)