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: "tractability frontier of data complexity in team semantics"
  Abstract: We study the data complexity of model-checking for logics with team semantics. For dependence and independence logic, we completely characterize the tractability/intractability frontier of data complexity of both quantifier-free and quantified formulas. For inclusion logic formulas, we reduce the model-checking problem to the satisfiability problem of so-called Dual-Horn propositional formulas. Via this reduction, we give an alternative proof for the recent result showing that the data complexity of inclusion logic is in PTIME.

Connected through hyperedge HE-1 (induced by source paper "complexity thresholds in inclusion logic"):
  with members:
    - "consistent query answering for primary keys in logspace"
    - "complexity of propositional logics in team semantics"
    - "approximation and dependence via multiteam 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-2 (induced by source paper "probabilistic team semantics"):
  with members:
    - "approximation and dependence via multiteam semantics"
    - "inclusion logic and fixed point logic"
    - "dependence and independence"

Connected through hyperedge HE-3 (induced by source paper "approximation and dependence via multiteam semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "a van benthem theorem for modal team semantics"
    - "on independence atoms and keys"
    - "decidability of predicate logics with team semantics"
    - "context specific independence in bayesian networks"
    - "inclusion logic and fixed point 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)