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: "parameterizing edge modification problems above lower bounds"
  Abstract: We study the parameterized complexity of a variant of the F-free Editing problem: Given a graph G and a natural number k, is it possible to modify at most k edges in G so that the resulting graph contains no induced subgraph isomorphic to F? In our variant, the input additionally contains a vertex-disjoint packing #N#                  #N#                    #N#                  #N#                  #N#                    #N#                  #N#                  $\mathcal {H}$#N#                 of induced subgraphs of G, which provides a lower bound #N#                  #N#                    #N#                  #N#                  #N#                    #N#                  #N#                  $h(\mathcal {H})$#N#                 on the number of edge modifications required to transform G into an F-free graph. While earlier works used the number k as parameter or structural parameters of the input graph G, we consider instead the parameter #N#                  #N#                    #N#                  #N#                  #N#                    #N#                  #N#                  $\ell :=k-h(\mathcal {H})$#N#                , that is, the number of edge modifications above the lower bound #N#                  #N#                    #N#                  #N#                  #N#                    #N#                  #N#                  $h(\mathcal {H})$#N#                . We develop a framework of generic data reduction rules to show fixed-parameter tractability with respect to l for K#N#                3-Free Editing, Feedback Arc Set in Tournaments, and Cluster Editing when the packing #N#                  #N#                    #N#                  #N#                  #N#                    #N#                  #N#                  $\mathcal {H}$#N#                 contains subgraphs with bounded solution size. For K#N#                3-Free Editing, we also prove NP-hardness in case of edge-disjoint packings of K#N#                3s and l = 0, while for K#N#                #N#                  q#N#                -Free Editing and q ≥ 6, NP-hardness for l = 0 even holds for vertex-disjoint packings of K#N#                #N#                  q#N#                s. In addition, we provide NP-hardness results for F-free Vertex Deletion, were the aim is to delete a minimum number of vertices to make the input graph F-free.

Connected through hyperedge HE-1 (induced by source paper "cluster editing parameterized above the size of a modification disjoint p 3 packing is para np hard"):
  with members:
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "faster parameterized algorithms using linear programming"
    - "subexponential fixed parameter tractability of cluster editing"
    - "on multiway cut parameterized above lower bounds"

Connected through hyperedge HE-2 (induced by source paper "parameterized algorithms for power efficiently connecting sensor networks theory and experiments"):
  with members:
    - "on approximate data reduction for the rural postman problem theory and experiments"
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "parameterized algorithms for power efficient connected symmetric wireless sensor networks"
    - "minimum power range assignment for symmetric connectivity in sensor networks with two power levels"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "on multiway cut parameterized above lower bounds"

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.DM(Discrete Mathematics)