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: "a van benthem theorem for modal team semantics"
  Abstract: The famous van Benthem theorem states that modal logic corresponds exactly to the fragment of first-order logic that is invariant under bisimulation. In this article we prove an exact analogue of this theorem in the framework of modal dependence logic MDL and team semantics. We show that modal team logic MTL, extending MDL by classical negation, captures exactly the FO-definable bisimulation invariant properties of Kripke structures and teams. We also compare the expressive power of MTL to most of the variants and extensions of MDL recently studied in the area.

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"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"
    - "dependence and independence"

Connected through hyperedge HE-2 (induced by source paper "a van benthem theorem for fuzzy modal logic"):
  with members:
    - "bisimulation metrics for weighted automata"
    - "a characterization theorem for a modal description logic"
    - "monadic second order logic and bisimulation invariance for coalgebras"
    - "behavioral metrics via functor lifting"
    - "neighbourhood structures bisimilarity and basic model theory"

Connected through hyperedge HE-3 (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"
    - "the expressive power of modal logic with inclusion atoms"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "axiomatizing propositional dependence logics"
    - "modal independence logic"
    - "dependence and independence"

Connected through hyperedge HE-4 (induced by source paper "the axioms of team logic"):
  with members:
    - "axiomatizing propositional dependence logics"
    - "dependence and independence"

Connected through hyperedge HE-5 (induced by source paper "approximation and dependence via multiteam semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "tractability frontier of data complexity in team semantics"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "on independence atoms and keys"
    - "decidability of predicate logics with team semantics"
    - "context specific independence in bayesian networks"
    - "inclusion logic and fixed point logic"

Connected through hyperedge HE-6 (induced by source paper "complexity of propositional logics in team semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "complete problems of propositional logic for the exponential hierarchy"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"
    - "dependence and independence"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"

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

Connected through hyperedge HE-8 (induced by source paper "modal independence logic"):
  with members:
    - "complexity of propositional independence and inclusion logic"
    - "dependence and independence"
    - "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)