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 "towards profit maximization for online social network providers"):
  Abstract: Online Social Networks (OSNs) attract billions of users to share information and communicate where viral marketing has emerged as a new way to promote the sales of products. An OSN provider is often hired by an advertiser to conduct viral marketing campaigns. The OSN provider generates revenue from the commission paid by the advertiser which is determined by the spread of its product information. Meanwhile, to propagate influence, the activities performed by users such as viewing video ads normally induce diffusion cost to the OSN provider. In this paper, we aim to find a seed set to optimize a new profit metric that combines the benefit of influence spread with the cost of influence propagation for the OSN provider. Under many diffusion models, our profit metric is the difference between two submodular functions which is challenging to optimize as it is neither submodular nor monotone. We design a general two-phase framework to select seeds for profit maximization and develop several bounds to measure the quality of the seed set constructed. Experimental results with real OSN datasets show that our approach can achieve high approximation guarantees and significantly outperform the baseline algorithms, including state-of-the-art influence maximization algorithms.

Includes members:
  Member "influence maximization meets efficiency and effectiveness a hop based approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rcelf a residual based approach for influence maximization problem")
  Member "stop and stare optimal sampling algorithms for viral marketing in billion scale networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "time constrained adaptive influence maximization")
  Member "profit maximization over social networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient approximation algorithms for adaptive target profit maximization")
  Member "maximizing social influence in nearly optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time constrained adaptive influence maximization")
  Member "algorithms for approximate minimization of the difference between submodular functions with applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal approximation for unconstrained non submodular minimization")
  Member "time critical influence maximization in social networks with time delayed diffusion process":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time constrained adaptive influence maximization")
  Member "uncovering the temporal dynamics of diffusion networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "deep collaborative embedding for information cascade prediction")

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.SI(Social and Information Networks)