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 "best case and worst case sparsifiability of boolean csps"):
  Abstract: We continue the investigation of polynomial-time sparsification for NP-complete Boolean Constraint Satisfaction Problems (CSPs). The goal in sparsification is to reduce the number of constraints in a problem instance without changing the answer, such that a bound on the number of resulting constraints can be given in terms of the number of variables n. We investigate how the worst-case sparsification size depends on the types of constraints allowed in the problem formulation (the constraint language). Two algorithmic results are presented. The first result essentially shows that for any arity k, the only constraint type for which no nontrivial sparsification is possible has exactly one falsifying assignment, and corresponds to logical OR (up to negations). Our second result concerns linear sparsification, that is, a reduction to an equivalent instance with O(n) constraints. Using linear algebra over rings of integers modulo prime powers, we give an elegant necessary and sufficient condition for a constraint type to be captured by a degree-1 polynomial over such a ring, which yields linear sparsifications. The combination of these algorithmic results allows us to prove two characterizations that capture the optimal sparsification sizes for a range of Boolean CSPs. For NP-complete Boolean CSPs whose constraints are symmetric (the satisfaction depends only on the number of 1 values in the assignment, not on their positions), we give a complete characterization of which constraint languages allow for a linear sparsification. For Boolean CSPs in which every constraint has arity at most three, we characterize the optimal size of sparsifications in terms of the largest OR that can be expressed by the constraint language.

Includes members:
  Member "optimal data reduction for graph coloring using low degree polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized complexity of conflict free graph coloring")
  Member "which np hard sat and csp problems admit exponentially improved algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bridging between 0 1 and linear programming via random walks")
  Member "kernelization of constraint satisfaction problems a study through universal algebra":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "optimal sparsification for some binary csps using low degree polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameterized complexity of conflict free graph coloring")
  Member "sparsification upper and lower bounds for graph problems and not all equal sat":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "point line cover the easy kernel is essentially tight":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dynamic complexity meets parameterised algorithms")
  Member "on sparsification for computing treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal sparsification for some binary csps using low degree polynomials")
  Member "weak bases of boolean co clones":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the strength of uniqueness quantification in primitive positive formulas")

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)