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 "surjective h colouring over reflexive digraphs"):
  Abstract: The Surjective H-Colouring problem is to test if a given graph allows a vertex-surjective homomorphism to a fixed graph H. The complexity of this problem has been well studied for undirected (partially) reflexive graphs. We introduce endo-triviality, the property of a structure that all of its endomorphisms that do not have range of size 1 are automorphisms, as a means to obtain complexity-theoretic classifications of Surjective H-Colouring in the case of reflexive digraphs. #R##N#Chen [2014] proved, in the setting of constraint satisfaction problems, that Surjective H-Colouring is NP-complete if H has the property that all of its polymorphisms are essentially unary. We give the first concrete application of his result by showing that every endo-trivial reflexive digraph H has this property. We then use the concept of endo-triviality to prove, as our main result, a dichotomy for Surjective H-Colouring when H is a reflexive tournament: if H is transitive, then Surjective H-Colouring is in NL, otherwise it is NP-complete. #R##N#By combining this result with some known and new results we obtain a complexity classification for Surjective H-Colouring when H is a partially reflexive digraph of size at most 3.

Includes members:
  Member "surjective h colouring new hardness results":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of approximately counting retractions")
  Member "a dichotomy theorem for nonuniform csps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "when symmetries are not enough a hierarchy of hard constraint satisfaction problems")
  Member "the proof of csp dichotomy conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "an algebraic hardness criterion for surjective constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "the complexity of surjective homomorphism problems a survey":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "a characterisation of first order constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rewritability in monadic disjunctive datalog mmsnp and expressive description logics")

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)