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 "seed selection and social coupon allocation for redemption maximization in online social networks"):
  Abstract: Online social networks have become the medium for efficient viral marketing exploiting social influence in information diffusion. However, the emerging application Social Coupon (SC) incorporating social referral into coupons cannot be efficiently solved by previous researches which do not take into account the effect of SC allocation. The number of allocated SCs restricts the number of influenced friends for each user. In the paper, we investigate not only the seed selection problem but also the effect of SC allocation for optimizing the redemption rate which represents the efficiency of SC allocation. Accordingly, we formulate a problem named Seed Selection and SC allocation for Redemption Maximization (S3CRM) and prove the hardness of S3CRM. We design an effective algorithm with a performance guarantee, called Seed Selection and Social Coupon allocation algorithm. For S3CRM, we introduce the notion of marginal redemption to evaluate the efficiency of investment in seeds and SCs. Moreover, for a balanced investment, we develop a new graph structure called guaranteed path, to explore the opportunity to optimize the redemption rate. Finally, we perform a comprehensive evaluation on our proposed algorithm with various baselines. The results validate our ideas and show the effectiveness of the proposed algorithm over baselines.

Includes members:
  Member "stochastic coupon probing in social networks":
    also connected through other hyperedges:
      (none)
  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 "towards profit maximization for online social network providers":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient approximation algorithms for adaptive target profit maximization")
  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 "when social influence meets item inference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing item and subgroup configurations for social aware vr shopping")
  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 "profit maximization over social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient approximation algorithms for adaptive target profit maximization")
  Member "a data based approach to social influence maximization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "use of a controlled experiment and computational models to measure the impact of sequential peer exposures on decision making")

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)