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 dependence logic"
  Abstract: We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended with intuitionistic disjunction. Furthermore, we show that the expressive power of modal logic with intuitionistic disjunction and extended modal dependence logic coincide. Finally we establish that any translation from extended modal dependence logic into modal logic with intuitionistic disjunction increases the size of some formulas exponentially.

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"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "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 "diversity dependence and independence"):
  with members:
    - "probabilistic team semantics"
    - "facets of distribution identities in probabilistic team semantics"
    - "team semantics for the specification and verification of hyperproperties"
    - "dependence and independence"

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

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"
    - "the expressive power of modal logic with inclusion atoms"
    - "complexity of propositional independence and inclusion logic"
    - "approximation and dependence via multiteam semantics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"

Connected through hyperedge HE-5 (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"
    - "the expressive power of modal logic with inclusion atoms"
    - "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"
    - "modal independence logic"

Connected through hyperedge HE-6 (induced by source paper "the expressive power of modal logic with inclusion atoms"):
  with members:
    - "satisfiability of modal inclusion logic lax and strict semantics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"

Connected through hyperedge HE-7 (induced by source paper "a team based variant of ctl"):
  with members:
    - "weak models of distributed computing with connections to modal logic"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"
    - "model checking ctl is almost always inherently sequential"

Connected through hyperedge HE-8 (induced by source paper "complexity of validity for propositional dependence logics"):
  with members:
    - "complexity of propositional independence and inclusion logic"
    - "modal independence logic"
    - "model checking for modal dependence logic an approach through post s lattice"
    - "computational aspects of dependence logic"
    - "dependence and independence"
    - "complexity of two variable dependence logic and if logic"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"

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)