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 "an issue in the martingale analysis of the influence maximization algorithm imm"):
  Abstract: This paper explains a subtle issue in the martingale analysis of the IMM algorithm, a state-of-the-art influence maximization algorithm. Two workarounds are proposed to fix the issue, both requiring minor changes on the algorithm and incurring a slight penalty on the running time of the algorithm.

Includes members:
  Member "multi round influence maximization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "time constrained adaptive influence maximization")
  Member "interplay between social influence and network centrality a comparative study on shapley centrality and single node influence centrality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "maximizing influence based group shapley centrality")
  Member "stop and stare optimal sampling algorithms for viral marketing in billion scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "time constrained adaptive influence maximization")
  Member "sketch based influence maximization and computation scaling up with guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "rcelf a residual based approach for influence maximization problem")
  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 "irie scalable and robust influence maximization in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "limitations of greed influence maximization in undirected networks re visited")

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)