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 "dynamic monopolies in reversible bootstrap percolation"):
  Abstract: We study an extremal question for the (reversible) $r-$bootstrap percolation processes. Given a graph and an initial configuration where each vertex is active or inactive, in the $r-$bootstrap percolation process the following rule is applied in discrete-time rounds: each vertex gets active if it has at least $r$ active neighbors, and an active vertex stays active forever. In the reversible $r$-bootstrap percolation, each vertex gets active if it has at least $r$ active neighbors, and inactive otherwise. We consider the following question on the $d$-dimensional torus: how many vertices should be initially active so that the whole graph becomes active? Our results settle an open problem by Balister, Bollob\'as, Johnson, and Walters and generalize the results by Flocchini, Lodi, Luccio, Pagli, and Santoro.

Includes members:
  Member "biased majority rule cellular automata":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tight bounds on the minimum size of a dynamic monopoly")
  Member "majority model on random regular graphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "influencing opinion dynamics in networks with limited interaction")

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)