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 "faster algorithms for vertex partitioning problems parameterized by clique width"):
  Abstract: Abstract   Many  NP -hard problems, such as  Dominating Set , are  FPT  parameterized by clique-width. For graphs of clique-width k given with a k-expression,  Dominating Set  can be solved in      4    k      n    O  (  1  )      time. However, no  FPT  algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a    (    2    3  k    −  1  )   -expression via rank-width and then solving  Dominating Set  using the    (    2    3  k    −  1  )   -expression, the above algorithm will only give a runtime of      4      2    3  k        n    O  (  1  )     . There have been results which overcome this exponential jump; the best known algorithm can solve  Dominating Set  in time      2    O  (    k    2    )      n    O  (  1  )      by avoiding constructing a k-expression Bui-Xuan et al. (2013)  [7] . We improve this to      2    O  (  k  log    k  )      n    O  (  1  )     . Indeed, we show that for a graph of clique-width k, a large class of domination and partitioning problems (LC-VSP), including  Dominating Set , can be solved in      2    O  (  k  log    k  )      n    O  (  1  )     .  Our main tool is a variant of rank-width using the rank of a 0–1 matrix over the rational field instead of the binary field.

Includes members:
  Member "the rank width of edge coloured graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "comparing linear width parameters for directed graphs")
  Member "interval deletion is fixed parameter tractable":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hitting topological minors is fpt")
  Member "known algorithms on graphs of bounded treewidth are probably optimal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the complexity of finding large odd induced subgraphs and odd colorings")
  Member "a comparison of two approaches for polynomial time algorithms computing basic graph parameters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "oriented coloring on recursively defined digraphs")

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)