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 "tight bounds on the minimum size of a dynamic monopoly"):
  Abstract: Assume that you are given a graph $G=(V,E)$ with an initial coloring, where each node is black or white. Then, in discrete-time rounds all nodes simultaneously update their color following a predefined deterministic rule. This process is called two-way $r$-bootstrap percolation, for some integer $r$, if a node with at least $r$ black neighbors gets black and white otherwise. Similarly, in two-way $\alpha$-bootstrap percolation, for some $0<\alpha<1$, a node gets black if at least $\alpha$ fraction of its neighbors are black, and white otherwise. The two aforementioned processes are called respectively $r$-bootstrap and $\alpha$-bootstrap percolation if we require that a black node stays black forever. For each of these processes, we say a node set $D$ is a dynamic monopoly whenever the following holds: If all nodes in $D$ are black then the graph gets fully black eventually. We provide tight upper and lower bounds on the minimum size of a dynamic monopoly.

Includes members:
  Member "dynamic monopolies in reversible bootstrap percolation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "opinion forming in binomial random graph and expanders")
  Member "opinion forming in erdos renyi random graph and expanders":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fake news and rumors a trigger for proliferation or fading away")
  Member "biased majority rule cellular automata":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "opinion forming in binomial random graph and expanders")
  Member "majority model on random regular graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "influencing opinion dynamics in networks with limited interaction")
  Member "contagious sets in dense graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "whom to befriend to influence people")
  Member "contagious sets in expanders":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "time bounded influence diffusion with incentives")

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.DS(Data Structures and Algorithms)