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 "uniform csp parameterized by solution size is in w 1"):
  Abstract: We show that the uniform Constraint Satisfaction Problem (CSP) parameterized by the size of the solution is in W[1] (the problem is W[1]-hard and it is easy to place it in W[3]). We study the problem on the Boolean domain, that is {0, 1}. The size of a solution is the number of variables that are mapped to 1. Named by Kolaitis and Vardi (2000), uniform CSP means that the input contains the domain and the list of tuples of each relation in the instance. Uniform CSP is polynomial time equivalent to homomorphism problem and also to evaluation of conjunctive queries on relational databases. It also has applications in artificial intelligence. We do not restrict the problem to any (finite or infinite) family of relations. Uniform CSP restricted to some finite family of Boolean relations (thus with a bound on the arity of relations) can easily be placed in W[1]. Marx (2005) proved that any such problem is either W[1]-complete or fixed parameter tractable. Together with Bulatov (2014) they extended this result to any finite domain. Our proof gives a nondeterministic RAM program with special properties deciding the problem. First defined by Chen et al. (2005), such programs characterize W[1]. Our work builds upon the work of Cesati (2002), which, answering a longstanding open question, shows that parameterized Exact Weighted CNF is in W[1]. This problem is equivalent to uniform CSP restricted to a specific (infinite) family of Boolean relations, where a tuple is in a relation, if and only if the tuple has exactly one 1. Thus, our result generalizes that of Cesati in at least two ways: There is no bound on the size of the tuples of the relations, and the relations do not need to be symmetric.

Includes members:
  Member "parameterized complexity of csp for infinite constraint languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized intractability of even set and shortest vector problem")
  Member "a polynomial turing kernel for weighted independent set in bull free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a hierarchy of polynomial kernels")
  Member "improved fpt algorithms for weighted independent set in bull free graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "when maximum stable set can be solved in fpt time")
  Member "losing weight by gaining edges":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple gap producing reduction for the parameterized set cover problem")
  Member "constraint satisfaction parameterized by solution size":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal sparsification for some binary csps using low degree polynomials")

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)