human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "model checking for modal dependence logic an approach through post s lattice"):
  Abstract: In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko V\"a\"an\"anen by extending modal logic by a the dependence atom dep(.). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using a Lattice approach introduced by Emil Post. This classification is done for all fragments of the logical language allowing modalities $\Diamond$ and $\Box$, the dependence atom, and logical symbols for arbitrary Boolean functions.

Includes members:
  Member "complexity results for modal dependence logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "canonical models and the complexity of modal team logic")
  Member "complexity of model checking for modal dependence logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enumeration complexity of poor man s propositional dependence logic")
  Member "on the applicability of post s lattice":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the connectivity of boolean satisfiability dichotomies for formulas and circuits")
  Member "generalized modal satisfiability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quirky quantifiers optimal models and complexity of computation tree logic")
  Member "the tractability of model checking for ltl the good the bad and the ugly fragments":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parameterised complexity of abduction in schaefer s framework")

Question: Please tell me which class the source paper 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.CC(Computational Complexity)