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 "algebraic theory of promise constraint satisfaction problems first steps"):
  Abstract: What makes a computational problem easy (e.g., in P, that is, solvable in polynomial time) or hard (e.g., NP-hard)? This fundamental question now has a satisfactory answer for a quite broad class of computational problems, so called fixed-template constraint satisfaction problems (CSPs) – it has turned out that their complexity is captured by a certain specific form of symmetry. This paper explains an extension of this theory to a much broader class of computational problems, the promise CSPs, which includes relaxed versions of CSPs such as the problem of finding a 137-coloring of a 3-colorable graph.

Includes members:
  Member "promises make finite constraint satisfaction problems infinitary":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sandwiches for promise constraint satisfaction")
  Member "an algorithmic blend of lps and ring equations for promise csps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the power of the combined basic lp and affine relaxation for promise csps")
  Member "algebraic approach to promise constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications")
  Member "promise constraint satisfaction algebraic structure and a symmetric boolean dichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic approach to promise constraint satisfaction")
  Member "a dichotomy theorem for nonuniform csps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "improved hardness of approximating chromatic number":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved hardness for h colourings of g colourable graphs")

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)