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 "target set in threshold models"):
  Abstract: Consider a graph $G$ and an initial coloring, where each node is blue or red. In each round, all nodes simultaneously update their color based on a predefined rule. In a threshold model, a node becomes blue if a certain number or fraction of its neighbors are blue and red otherwise. What is the minimum number of nodes which must be blue initially so that the whole graph becomes blue eventually? We study this question for graphs which have expansion properties, parameterized by spectral gap, in particular the Erdős-Renyi random graph and random regular graphs.

Includes members:
  Member "opinion forming in erdos renyi random graph and expanders":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "fake news and rumors a trigger for proliferation or fading away")
  Member "tight bounds on the minimum size of a dynamic monopoly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "phase transition in democratic opinion dynamics")
  Member "majority model on random regular graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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)