human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "optimal sparsification for some binary csps using low degree polynomials"
  Abstract: This paper analyzes to what extent it is possible to efficiently reduce the number of clauses in NP-hard satisfiability problems, without changing the answer. Upper and lower bounds are established using the concept of kernelization. Existing results show that if NP is not contained in coNP/poly, no efficient preprocessing algorithm can reduce n-variable instances of CNF-SAT with d literals per clause, to equivalent instances with $O(n^{d-e})$ bits for any e > 0. For the Not-All-Equal SAT problem, a compression to size $\~O(n^{d-1})$ exists. We put these results in a common framework by analyzing the compressibility of binary CSPs. We characterize constraint types based on the minimum degree of multivariate polynomials whose roots correspond to the satisfying assignments, obtaining (nearly) matching upper and lower bounds in several settings. Our lower bounds show that not just the number of constraints, but also the encoding size of individual constraints plays an important role. For example, for Exact Satisfiability with unbounded clause length it is possible to efficiently reduce the number of constraints to n+1, yet no polynomial-time algorithm can reduce to an equivalent instance with $O(n^{2-e})$ bits for any e > 0, unless NP is a subset of coNP/poly.

Connected through hyperedge HE-1 (induced by source paper "parameterized complexity of conflict free graph coloring"):
  with members:
    - "optimal data reduction for graph coloring using low degree polynomials"
    - "data reduction for graph coloring problems"
    - "kernelization lower bounds by cross composition"
    - "known algorithms on graphs of bounded treewidth are probably optimal"

Connected through hyperedge HE-2 (induced by source paper "optimal data reduction for graph coloring using low degree polynomials"):
  with members:
    - "smaller parameters for vertex cover kernelization"
    - "fine grained parameterized complexity analysis of graph coloring problems"
    - "how much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs"
    - "sparsification upper and lower bounds for graph problems and not all equal sat"
    - "point line cover the easy kernel is essentially tight"
    - "data reduction for graph coloring problems"
    - "list h coloring a graph by removing few vertices"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-3 (induced by source paper "best case and worst case sparsifiability of boolean csps"):
  with members:
    - "optimal data reduction for graph coloring using low degree polynomials"
    - "which np hard sat and csp problems admit exponentially improved algorithms"
    - "kernelization of constraint satisfaction problems a study through universal algebra"
    - "sparsification upper and lower bounds for graph problems and not all equal sat"
    - "point line cover the easy kernel is essentially tight"
    - "on sparsification for computing treewidth"
    - "weak bases of boolean co clones"
    - "kernelization lower bounds by cross composition"

Connected through hyperedge HE-4 (induced by source paper "the polynomial hierarchy collapses"):
  with members:
    - "sparsification upper and lower bounds for graph problems and not all equal sat"

Connected through hyperedge HE-5 (induced by source paper "kernelization of constraint satisfaction problems a study through universal algebra"):
  with members:
    - "on the hardness of losing weight"
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "sparsification upper and lower bounds for graph problems and not all equal sat"
    - "an effective dichotomy for the counting constraint satisfaction problem"
    - "preprocessing of min ones problems a dichotomy"

Connected through hyperedge HE-6 (induced by source paper "sparsification upper and lower bounds for graph problems and not all equal sat"):
  with members:
    - "tight kernel bounds for problems on graphs with small degeneracy"
    - "data reduction for graph coloring problems"
    - "on sparsification for computing treewidth"
    - "kernelization lower bounds by cross composition"
    - "kernelization of packing problems"
    - "kernel bounds for path and cycle problems"
    - "co nondeterminism in compositions a kernelization lower bound for a ramsey type problem"
    - "dominating set is fixed parameter tractable in claw free graphs"

Question: Please tell me which class the center node 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)