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 "on singleton arc consistency for csps defined by monotone patterns"):
  Abstract: Singleton arc consistency is an important type of local consistency which has been recently shown to solve all constraint satisfaction problems (CSPs) over constraint languages of bounded width. We aim to characterise all classes of CSPs defined by a forbidden pattern that are solved by singleton arc consistency and closed under removing constraints. We identify five new patterns whose absence ensures solvability by singleton arc consistency, four of which are provably maximal and three of which generalise 2-SAT. Combined with simple counter-examples for other patterns, we make significant progress towards a complete classification.

Includes members:
  Member "a dichotomy theorem for nonuniform csps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "weaker consistency notions for all the csps of bounded width":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a polynomial time algorithm for median closed semilinear constraints")
  Member "the power of arc consistency for csps defined by partially ordered forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "binary constraint satisfaction problems defined by excluded topological minors")
  Member "variable and value elimination in binary constraint satisfaction via forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "binary constraint satisfaction problems defined by excluded topological minors")
  Member "the tractability of csp classes defined by forbidden patterns":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "testing unsatisfiability of constraint satisfaction problems via tensor products")
  Member "arc consistency and friends":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a polynomial time algorithm for median closed semilinear constraints")
  Member "hybrid tractability of valued constraint problems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "binary constraint satisfaction problems defined by excluded topological minors")

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)