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 "graphs with extremal connected forcing numbers"):
  Abstract: Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which the initially colored set of vertices induces a connected subgraph; the analogous parameter of interest is the connected forcing number. In this paper, we characterize the graphs with connected forcing numbers 2 and $n-2$. Our results extend existing characterizations of graphs with zero forcing numbers 2 and $n-2$; we use combinatorial and graph theoretic techniques, in contrast to the linear algebraic approach used to obtain the latter. We also present several other structural results about the connected forcing sets of a graph.

Includes members:
  Member "complexity and computation of connected zero forcing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computational approaches for zero forcing and related problems")
  Member "characterizations of the connected forcing number of a graph":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational approaches for zero forcing and related problems")
  Member "logic circuits from zero forcing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational approaches for zero forcing and related problems")
  Member "zero forcing number constrained matchings and strong structural controllability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal regulation of flow networks with transient constraints")

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)