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: "dependence and independence"
  Abstract: We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence.

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"
    - "a van benthem theorem for modal team semantics"
    - "complexity of validity for propositional dependence logics"
    - "modal independence logic"

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"
    - "the expressive power of modal dependence logic"

Connected through hyperedge HE-3 (induced by source paper "interventionist counterfactuals on causal teams"):
  with members:
    - "approximation and dependence via multiteam semantics"
    - "axiomatizing causal reasoning"

Connected through hyperedge HE-4 (induced by source paper "on the union closed fragment of existential second order logic and logics with team semantics"):
  with members:
    - "inclusion logic and fixed point logic"

Connected through hyperedge HE-5 (induced by source paper "facets of distribution identities in probabilistic team semantics"):
  with members:
    - "interventionist counterfactuals on causal teams"
    - "probabilistic team semantics"
    - "canonical models and the complexity of modal team logic"
    - "team semantics for the specification and verification of hyperproperties"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "complexity of propositional logics in team semantics"
    - "approximation and dependence via multiteam semantics"

Connected through hyperedge HE-6 (induced by source paper "probabilistic team semantics"):
  with members:
    - "tractability frontier of data complexity in team semantics"
    - "approximation and dependence via multiteam semantics"
    - "inclusion logic and fixed point logic"

Connected through hyperedge HE-7 (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"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"

Connected through hyperedge HE-8 (induced by source paper "enumeration complexity of poor man s propositional dependence logic"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "complexity of propositional independence and inclusion logic"
    - "paradigms for parameterized enumeration"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence logic"
    - "the complexity of poor man s 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)