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: "the parameterized complexity of global constraints"
  Abstract: We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them fixed-parameter tractable and which are easy to compute. This tractability tends either to be the result of a simple dynamic program or of a decomposition which has a strong backdoor of bounded size. This strong backdoor is often a cycle cutset. We also show that parameterized complexity can be used to study other aspects of constraint programming like symmetry breaking. For instance, we prove that value symmetry is fixed-parameter tractable to break in the number of symmetries. Finally, we argue that parameterized complexity can be used to derive results about the approximability of constraint propagation.

Connected through hyperedge HE-1 (induced by source paper "parameterized algorithms for the matrix completion problem"):
  with members:
    - "the parameterized complexity of positional games"
    - "h index manipulation by merging articles"
    - "computational limits for matrix completion"
    - "sparse subspace clustering algorithm theory and applications"
    - "matrix completion from noisy entries"
    - "matrix completion from a few entries"
    - "a simpler approach to matrix completion"
    - "matrix completion with noise"

Connected through hyperedge HE-2 (induced by source paper "propagation via kernelization the vertex cover constraint"):
  with members:
    - "kernels for global constraints"

Connected through hyperedge HE-3 (induced by source paper "guarantees and limits of preprocessing in constraint satisfaction and reasoning"):
  with members:
    - "on feedback vertex set new measure and new structures"
    - "parameterized complexity and kernel bounds for hard planning problems"
    - "backdoors to satisfaction"
    - "backdoors to tractable answer set programming"
    - "limits of preprocessing"
    - "kernels for global constraints"
    - "range and roots two common patterns for specifying and propagating counting and occurrence constraints"
    - "cutset sampling for bayesian networks"

Connected through hyperedge HE-4 (induced by source paper "limits of preprocessing"):
  with members:
    - "backdoors to tractable answer set programming"
    - "kernels for global constraints"
    - "range and roots two common patterns for specifying and propagating counting and occurrence constraints"
    - "kernel s for problems with no kernel on out trees with many leaves"
    - "cutset sampling for bayesian networks"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-5 (induced by source paper "k gap interval graphs"):
  with members:
    - "data reduction for graph coloring problems"
    - "kernels for global constraints"
    - "on restrictions of balanced 2 interval graphs"

Connected through hyperedge HE-6 (induced by source paper "parameterized complexity results for general factors in bipartite graphs with an application to constraint programming"):
  with members:
    - "limits of preprocessing"
    - "kernels for global constraints"

Connected through hyperedge HE-7 (induced by source paper "kernels for global constraints"):
  with members:
    - "limits of preprocessing"

Connected through hyperedge HE-8 (induced by source paper "parameterized complexity results in symmetry breaking"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "symmetry within and between solutions"
    - "breaking value symmetry"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"

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.AI(Artificial Intelligence)