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: "approximation and dependence via multiteam semantics"
  Abstract: We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms and certain approximation operators motivated by approximate dependence atoms of V\"a\"an\"anen.

Connected through hyperedge HE-1 (induced by source paper "descriptive complexity of real computation and probabilistic independence logic"):
  with members:
    - "probabilistic team semantics"
    - "facets of distribution identities in probabilistic team semantics"
    - "team semantics for the specification and verification of hyperproperties"
    - "inclusion logic and fixed point logic"

Connected through hyperedge HE-2 (induced by source paper "complexity thresholds in inclusion logic"):
  with members:
    - "consistent query answering for primary keys in logspace"
    - "tractability frontier of data complexity in team semantics"
    - "complexity of propositional logics in team semantics"
    - "complexity of validity for propositional dependence logics"
    - "a fragment of dependence logic capturing polynomial time"
    - "inclusion logic and fixed point logic"
    - "complexity of two variable dependence logic and if logic"
    - "minimal change integrity maintenance using tuple deletions"

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

Connected through hyperedge HE-4 (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"
    - "dependence and independence"

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

Connected through hyperedge HE-6 (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"
    - "modal inclusion logic being lax is simpler than being strict"
    - "the expressive power of modal dependence logic"
    - "complexity of validity for propositional dependence logics"

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)