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 "complexity and approximability of parameterized max csps"):
  Abstract: We study the optimization version of constraint satisfaction problems (Max-CSPs) in the framework of parameterized complexity; the goal is to compute the maximum fraction of constraints that can be satisfied simultaneously. In standard CSPs, we want to decide whether this fraction equals one. The parameters we investigate are structural measures, such as the treewidth or the clique-width of the variable–constraint incidence graph of the CSP instance. We consider Max-CSPs with the constraint types \({\text {AND}}\), \({\text {OR}}\), \({\text {PARITY}}\), and \({\text {MAJORITY}}\), and with various parameters k, and we attempt to fully classify them into the following three cases:#R##N##R##N#1.#R##N##R##N#The exact optimum can be computed in \(\textsf {FPT}\) time.#R##N##R##N##R##N##R##N##R##N#2.#R##N##R##N#It is Open image in new window -hard to compute the exact optimum, but there is a randomized \(\textsf {FPT}\) approximation scheme (\(\textsf {FPT\text {-}AS}\)), which computes a \((1{-}\epsilon )\)-approximation in time \(f(k,\epsilon ) \cdot {\text {poly}}(n)\).#R##N##R##N##R##N##R##N##R##N#3.#R##N##R##N#There is no \(\textsf {FPT\text {-}AS}\) unless Open image in new window .#R##N##R##N##R##N##R##N##R##N##R##N##R##N#For the corresponding standard CSPs, we establish \(\textsf {FPT}\) versus Open image in new window -hardness results.

Includes members:
  Member "solving maxsat and sat on structured cnf formulas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "knowledge compilation width and quantification")
  Member "tractable answer set programming with weight constraints bounded treewidth is not enough":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "treewidth and counting projected answer sets")
  Member "guarantees and limits of preprocessing in constraint satisfaction and reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diversity in combinatorial optimization")
  Member "model counting for formulas of bounded clique width":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "revisiting graph width measures for cnf encodings")
  Member "a characterization of approximation resistance for even k partite csps":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the approximation resistance of balanced linear threshold functions")
  Member "satisfiability of acyclic and almost acyclic cnf formulas":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "understanding the complexity of sat using knowledge compilation")
  Member "majority is stablest discrete and sos":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sos and planted clique tight analysis of mpw moments at all degrees and an optimal lower bound at degree four")
  Member "backdoors to acyclic sat":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "backdoors to abduction")

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)