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 "irreversible 2 conversion set in graphs of bounded degree"):
  Abstract: An irreversible $k$-threshold process (also a $k$-neighbor bootstrap#N#percolation) is a dynamic process on a graph where vertices change color from#N#white to black if they have at least $k$ black neighbors. An irreversible#N#$k$-conversion set of a graph $G$ is a subset $S$ of vertices of $G$ such that#N#the irreversible $k$-threshold process starting with $S$ black eventually#N#changes all vertices of $G$ to black. We show that deciding the existence of an#N#irreversible 2-conversion set of a given size is NP-complete, even for graphs#N#of maximum degree 4, which answers a question of Dreyer and Roberts.#N#Conversely, we show that for graphs of maximum degree 3, the minimum size of an#N#irreversible 2-conversion set can be computed in polynomial time. Moreover, we#N#find an optimal irreversible 3-conversion set for the toroidal grid,#N#simplifying constructions of Pike and Zou.

Includes members:
  Member "on feedback vertex set new measure and new structures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hitting long directed cycles is fixed parameter tractable")
  Member "the maximum time of 2 neighbor bootstrap percolation complexity results":
    also connected through other hyperedges:
      (none)

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)