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 "on complexities of minus domination"):
  Abstract: A function f: V \rightarrow \{-1,0,1\} is a minus-domination function of a graph G=(V,E) if the values over the vertices in each closed neighborhood sum to a positive number. The weight of f is the sum of f(x) over all vertices x \in V. The minus-domination number \gamma^{-}(G) is the minimum weight over all minus-domination functions. The size of a minus domination is the number of vertices that are assigned 1. In this paper we show that the minus-domination problem is fixed-parameter tractable for d-degenerate graphs when parameterized by the size of the minus-dominating set and by d. The minus-domination problem is polynomial for graphs of bounded rankwidth and for strongly chordal graphs. It is NP-complete for splitgraphs. Unless P=NP there is no fixed-parameter algorithm for minus-domination. 79,1 5%

Includes members:
  Member "signed and minus domination in complete multipartite graphs":
    also connected through other hyperedges:
      (none)
  Member "kernels for connected dominating set on graphs with excluded topological subgraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a general kernelization technique for domination and independence problems in sparse classes")
  Member "practical and efficient split decomposition via graph labelled trees":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "circle graph isomorphism in almost linear time")
  Member "linear time algorithms for graphs of bounded rankwidth a fresh look using game theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "kernelizing mso properties of trees of fixed height and some consequences")
  Member "linear time split decomposition revisited":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs")
  Member "linear time algorithms for finding a dominating set of fixed size in degenerated graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parallel algorithms for small subgraph counting")

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)