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 "generalized modal satisfiability"):
  Abstract: It is well known that modal satisfiability is PSPACE-complete (Ladner 1977). However, the complexity may decrease if we restrict the set of propositional operators used. Note that there exist an infinite number of propositional operators, since a propositional operator is simply a Boolean function. We completely classify the complexity of modal satisfiability for every finite set of propositional operators, i.e., in contrast to previous work, we classify an infinite number of problems. We show that, depending on the set of propositional operators, modal satisfiability is PSPACE-complete, coNP-complete, or in P. We obtain this trichotomy not only for modal formulas, but also for their more succinct representation using modal circuits. We consider both the uni-modal and the multi-modal case, and study the dual problem of validity as well.

Includes members:
  Member "pspace bounds for rank 1 modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal satisfiability checking for arithmetic mu calculi")
  Member "the complexity of generalized satisfiability for linear temporal logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parameterised complexity of abduction in schaefer s framework")
  Member "the tractability of model checking for ltl the good the bad and the ugly fragments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterised complexity of abduction in schaefer s framework")
  Member "on the complexity of elementary modal logics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "kripke completeness of strictly positive modal logics over meet semilattices with operators")
  Member "the complexity of poor man s logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity and expressivity of branching and alternating time temporal logics with finitely many variables")

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)