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 "the complexity of promise sat on non boolean domains"):
  Abstract: While 3-SAT is NP-hard, 2-SAT is solvable in polynomial time. Austrin, Guruswami, and Hastad established, in precise terms, that the transition from tractability to hardness occurs just after 2 [FOCS'14/SICOMP'17]. They showed that the problem of distinguishing k-CNF formulas that are g-satisfiable (i.e. some assignment satisfies at least g literals in every clause) from those that are not even 1-satisfiable is NP-hard if $\frac{g}{k} < \frac{1}{2}$ and is in P otherwise. We study a generalisation of SAT on arbitrary finite domains, with clauses that are disjunctions of unary constraints, and establish analogous behaviour. Thus we give a dichotomy for a natural fragment of promise constraint satisfaction problems (PCSPs) on arbitrary finite domains.

Includes members:
  Member "symmetric polymorphisms and efficient decidability of promise csps":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sandwiches for promise constraint satisfaction")
  Member "the complexity of 3 colouring h colourable graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved hardness for h colourings of g colourable graphs")
  Member "dichotomy for symmetric boolean pcsps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the power of the combined basic lp and affine relaxation for promise csps")
  Member "an algorithmic blend of lps and ring equations for promise csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the power of the combined basic lp and affine relaxation for promise csps")
  Member "improved inapproximability of rainbow coloring":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved hardness for h colourings of g colourable graphs")
  Member "algebraic approach to promise constraint satisfaction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications")
  Member "a new multilayered pcp and the hardness of hypergraph vertex cover":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an improved algorithm for dynamic set cover")

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.DM(Discrete Mathematics)