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 "time bounded influence diffusion with incentives"):
  Abstract: A widely studied model of influence diffusion in social networks represents the network as a graph $G=(V,E)$ with an influence threshold $t(v)$ for each node. Initially the members of an initial set $S\subseteq V$ are influenced. During each subsequent round, the set of influenced nodes is augmented by including every node $v$ that has at least $t(v)$ previously influenced neighbours. The general problem is to find a small initial set that influences the whole network. In this paper we extend this model by using \emph{incentives} to reduce the thresholds of some nodes. The goal is to minimize the total of the incentives required to ensure that the process completes within a given number of rounds. The problem is hard to approximate in general networks. We present polynomial-time algorithms for paths, trees, and complete networks.

Includes members:
  Member "selecting nodes and buying links to maximize the information diffusion in a network":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "recommending links through influence maximization")
  Member "evangelism in social networks algorithms and complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "iterated type partitions")
  Member "discovering small target sets in social networks a fast and effective algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "whom to befriend to influence people")
  Member "on finding small sets that influence large networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "evangelism in social networks algorithms and complexity")
  Member "spread of influence in weighted networks under time and budget constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "whom to befriend to influence people")
  Member "latency bounded target set selection in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on influence maximization in a social network")
  Member "how to influence people with partial incentives":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "scalable lattice influence maximization")
  Member "influence diffusion in social networks under time window constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a computational study of f reversible processes on graphs")

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)