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: "the complexity of surjective homomorphism problems a survey"
  Abstract: We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which remain of open complexity.

Connected through hyperedge HE-1 (induced by source paper "the complexity of boolean surjective general valued csps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of finite valued csps"
    - "a galois connection for weighted relational clones of infinite size"
    - "algebraic properties of valued constraint satisfaction problem"
    - "the complexity of general valued csps"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "an algebraic theory of complexity for discrete optimization"

Connected through hyperedge HE-2 (induced by source paper "beyond boolean surjective vcsps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "algebraic properties of valued constraint satisfaction problem"
    - "towards minimizing k submodular functions"
    - "the complexity of global cardinality constraints"

Connected through hyperedge HE-3 (induced by source paper "the complexity of approximately counting retractions to square free graphs"):
  with members:
    - "counting homomorphisms modulo a prime number"
    - "a dichotomy theorem for nonuniform csps"
    - "counting homomorphisms to square free graphs modulo 2"
    - "the complexity of approximately counting tree homomorphisms"

Connected through hyperedge HE-4 (induced by source paper "the data complexity of ontology mediated queries with closed predicates"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "dichotomies in ontology mediated querying with the guarded fragment"
    - "the data complexity of description logic ontologies"
    - "inseparability and conservative extensions of description logic ontologies a survey"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "ontology based data access a study through disjunctive datalog csp and mmsnp"
    - "the dl lite family and relations"

Connected through hyperedge HE-5 (induced by source paper "the complexity of approximately counting retractions"):
  with members:
    - "surjective h colouring new hardness results"
    - "a dichotomy theorem for nonuniform csps"
    - "approximately counting h colourings is bis hard"
    - "the complexity of approximately counting tree homomorphisms"
    - "ferromagnetic potts model refined bis hardness and related results"
    - "an approximation trichotomy for boolean csp"

Connected through hyperedge HE-6 (induced by source paper "disconnected cuts in claw free graphs"):
  with members:
    - "parameterized complexity of induced graph matching on claw free graphs"
    - "domination when the stars are out"

Connected through hyperedge HE-7 (induced by source paper "the complexity of counting surjective homomorphisms and compactions"):
  with members:
    - "homomorphisms are a good basis for counting small subgraphs"
    - "surjective h colouring new hardness results"
    - "homomorphisms are indeed a good basis for counting three fixed template dichotomy theorems for the price of one"
    - "note on the complexity of counting surjective homomorphisms and compactions"
    - "counting homomorphisms to square free graphs modulo 2"
    - "finding vertex surjective graph homomorphisms"

Connected through hyperedge HE-8 (induced by source paper "surjective h colouring over reflexive digraphs"):
  with members:
    - "surjective h colouring new hardness results"
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "a characterisation of first order constraint satisfaction problems"

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)