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 "importance sample based approximation algorithm for cost aware targeted viral marketing"):
  Abstract: Cost-aware Targeted Viral Marketing (CTVM), a generalization of Influence Maximization (IM), has received a lot of attentions recently due to its commercial values. Previous approximation algorithms for this problem required a large number of samples to ensure approximate guarantee. In this paper, we propose an efficient approximation algorithm which uses fewer samples but provides the same theoretical guarantees based on generating and using important samples in its operation. Experiments on real social networks show that our proposed method outperforms the state-of-the-art algorithm which provides the same approximation ratio in terms of the number of required samples and running time.

Includes members:
  Member "importance sketching of influence dynamics in billion scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rcelf a residual based approach for influence maximization problem")
  Member "why approximate when you can get the exact optimal targeted viral marketing at scale":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "submodular cost submodular cover with an approximate oracle")
  Member "least cost influence maximization across multiple social networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "diffusion on dynamic contact networks with indirect transmission links")
  Member "stop and stare optimal sampling algorithms for viral marketing in billion scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "time constrained adaptive influence maximization")
  Member "influence maximization near optimal time complexity meets practical efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time constrained adaptive influence maximization")
  Member "maximizing social influence in nearly optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "time constrained adaptive influence maximization")
  Member "defining and evaluating network communities based on ground truth":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "certified robustness of community detection against adversarial structural perturbation via randomized smoothing")

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)