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 "sparsification upper and lower bounds for graph problems and not all equal sat"):
  Abstract: We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time algorithm that reduces any n-vertex input to an equivalent instance, of an arbitrary problem, with bitsize O(n^{2-e}) for e > 0, unless NP is in coNP/poly and the polynomial-time hierarchy collapses. These results imply that existing linear-vertex kernels for k-Nonblocker and k-Max Leaf Spanning Tree (the parametric duals of (Connected) Dominating Set) cannot be improved to have O(k^{2-e}) edges, unless NP is in coNP/poly. We also present a positive result and exhibit a non-trivial sparsification algorithm for d-Not-All-Equal SAT. We give an algorithm that reduces an n-variable input with clauses of size at most d to an equivalent input with O(n^{d-1}) clauses, for any fixed d. Our algorithm is based on a linear-algebraic proof of Lovasz that bounds the number of hyperedges in critically 3-chromatic d-uniform n-vertex hypergraphs by n choose d-1. We show that our kernel is tight under the assumption that NP is not a subset of coNP/poly.

Includes members:
  Member "optimal sparsification for some binary csps using low degree polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized complexity of conflict free graph coloring")
  Member "tight kernel bounds for problems on graphs with small degeneracy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lossy kernels for connected dominating set on sparse graphs")
  Member "data reduction for graph coloring problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "on sparsification for computing treewidth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "best case and worst case sparsifiability of boolean csps")
  Member "kernelization lower bounds by cross composition":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "subexponential parameterized algorithms and kernelization on almost chordal graphs")
  Member "kernelization of packing problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the approximate compressibility of connected vertex cover")
  Member "kernel bounds for path and cycle problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "parameterized pre coloring extension and list coloring problems")
  Member "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "frameworks for solving turing kernel lower bound problem and finding natural candidate problems in np intermediate")

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)