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: "parameterized complexity and kernel bounds for hard planning problems"
  Abstract: The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Backstrom et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provide a full classification. In particular, we show that the case when actions have no preconditions and at most e postconditions is fixed-parameter tractable if e ≤ 2 and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; this problem has been shown fixed-parameter tractable by Guo et al. (2007). If a problem is fixed-parameter tractable, then it admits a polynomial-time self-reduction to instances whose input size is bounded by a function of the parameter, called the kernel. For some problems, this function is even polynomial which has desirable computational implications. Recent research in parameterized complexity has focused on classifying fixed-parameter tractable problems on whether they admit polynomial kernels or not. We revisit all the previously obtained restrictions of planning that are fixed-parameter tractable and show that none of them admits a polynomial kernel unless the polynomial hierarchy collapses to its third level.

Connected through hyperedge HE-1 (induced by source paper "diversity in combinatorial optimization"):
  with members:
    - "what is known about vertex cover kernelization"
    - "propagation via kernelization the vertex cover constraint"
    - "guarantees and limits of preprocessing in constraint satisfaction and reasoning"
    - "efficient classification for metric data"
    - "limits of preprocessing"
    - "kernels for global constraints"

Connected through hyperedge HE-2 (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"
    - "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"
    - "the parameterized complexity of global constraints"
    - "cutset sampling for bayesian networks"

Connected through hyperedge HE-3 (induced by source paper "parameterized complexity results for plan reuse"):
  with members:
    - "the complexity of planning revisited a parameterized analysis"
    - "the fast downward planning system"
    - "on the complexity of case based planning"
    - "a domain independent algorithm for plan adaptation"

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.DS(Data Structures and Algorithms)