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: "the expressive power of modal logic with inclusion atoms"
  Abstract: Modal inclusion logic is the extension of basic modal logic with inclusion atoms, and its semantics is defined on Kripke models with teams. A team of a Kripke model is just a subset of its domain. In this paper we give a complete characterisation for the expressive power of modal inclusion logic: a class of Kripke models with teams is definable in modal inclusion logic if and only if it is closed under k-bisimulation for some integer k, it is closed under unions, and it has the empty team property. We also prove that the same expressive power can be obtained by adding a single unary nonemptiness operator to modal logic. Furthermore, we establish an exponential lower bound for the size of the translation from modal inclusion logic to modal logic with the nonemptiness operator.

Connected through hyperedge HE-1 (induced by source paper "on the succinctness of atoms of dependency"):
  with members:
    - "canonical models and the complexity of modal team logic"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "a team based variant of ctl"
    - "the expressive power of modal dependence logic"
    - "a van benthem theorem for modal team semantics"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"
    - "dependence and independence"

Connected through hyperedge HE-2 (induced by source paper "uniform interpolation for propositional and modal team logics"):
  with members:
    - "the expressive power of modal dependence logic"
    - "modal independence logic"

Connected through hyperedge HE-3 (induced by source paper "canonical models and the complexity of modal team logic"):
  with members:
    - "on the complexity of team logic and its two variable fragment"
    - "a fine grained hierarchy of hard problems in the separated fragment"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complexity hierarchies beyond elementary"
    - "axiomatizations of team logics"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"

Connected through hyperedge HE-4 (induced by source paper "model checking and validity in propositional and modal inclusion logics"):
  with members:
    - "team semantics for the specification and verification of hyperproperties"
    - "validity and entailment in modal and propositional dependence logics"
    - "axiomatizations of team logics"
    - "complexity of propositional independence and inclusion logic"
    - "approximation and dependence via multiteam semantics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"

Connected through hyperedge HE-5 (induced by source paper "validity and entailment in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complete problems of propositional logic for the exponential hierarchy"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"

Connected through hyperedge HE-6 (induced by source paper "the entailment problem in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "complete problems of propositional logic for the exponential hierarchy"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"

Connected through hyperedge HE-7 (induced by source paper "axiomatizations of team logics"):
  with members:
    - "validity and entailment in modal and propositional dependence logics"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "a van benthem theorem for modal team semantics"
    - "axiomatizing propositional dependence logics"
    - "modal independence logic"
    - "dependence and independence"

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)