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 "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.

Includes members:
  Member "parameterized lower bounds and dichotomy results for the np completeness of h free edge modification problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on polynomial kernelization of mathcal h free edge deletion")
  Member "raising the bar for vertex cover fixed parameter tractability above a higher guarantee":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "elimination distances blocking sets and kernels for vertex cover")
  Member "towards optimal and expressive kernelization for d hitting set":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal size problem kernels for d hitting set in linear time and space")
  Member "subexponential parameterized algorithm for computing the cutwidth of a semi complete digraph":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "comparing linear width parameters for directed graphs")
  Member "faster parameterized algorithms using linear programming":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "subexponential fixed parameter tractability of cluster editing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "cluster editing parameterized above the size of a modification disjoint p 3 packing is para np hard")
  Member "on multiway cut parameterized above lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "structural parameterizations with modulator oblivion")
  Member "on the non existence of polynomial kernels for p l free edge modification problems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "faster and enhanced inclusion minimal cograph completion")

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