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: "complete problems of propositional logic for the exponential hierarchy"
  Abstract: Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction of Boolean higher-order quantifiers or equivalently Boolean Skolem functions. This builds on the important results of Wrathall and Stockmeyer regarding complete problems, namely QBF and QBF$_k$, for the polynomial hierarchy. Furthermore it generalizes the Dependency QBF problem introduced by Peterson, Reif and Azhar which is complete for NEXP, the first level of the exponential hierarchy. Also it turns out that the hardness results are much more robust against conjunctive and disjunctive normal forms than plain QBF.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of the quantified bit vector arithmetic with binary encoding"):
  with members:
    - "on quantified propositional logics and the exponential time hierarchy"

Connected through hyperedge HE-2 (induced by source paper "validity and entailment in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "on quantified propositional logics and the exponential time hierarchy"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"

Connected through hyperedge HE-3 (induced by source paper "the entailment problem in modal and propositional dependence logics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "the expressive power of modal logic with inclusion atoms"
    - "a team based variant of ctl"
    - "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"
    - "modal independence logic"

Connected through hyperedge HE-4 (induced by source paper "on quantified propositional logics and the exponential time hierarchy"):
  with members:
    - "complexity of propositional independence and inclusion logic"
    - "modal inclusion logic being lax is simpler than being strict"
    - "complexity of validity for propositional dependence logics"

Connected through hyperedge HE-5 (induced by source paper "complexity of propositional logics in team semantics"):
  with members:
    - "model checking and validity in propositional and modal inclusion logics"
    - "modal inclusion logic being lax is simpler than being strict"
    - "a van benthem theorem for modal team semantics"
    - "complexity of validity for propositional dependence logics"
    - "axiomatizing propositional dependence logics"
    - "dependence and independence"
    - "complexity results for modal dependence logic"
    - "complexity of model checking for modal dependence 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.CC(Computational Complexity)