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 "stochastic coupon probing in social networks"):
  Abstract: In this paper, we study stochastic coupon probing problem in social networks. Assume there is a social network and a set of coupons. We can offer coupons to some users adaptively and those users who accept the offer will act as seeds and influence their friends in the social network. There are two constraints which are called the inner and outer constraints, respectively. The set of coupons redeemed by users must satisfy inner constraints, and the set of all probed users must satisfy outer constraints. One seeks to develop a coupon probing policy that achieves the maximum influence while satisfying both inner and outer constraints. Our main result is a constant approximation policy for the stochastic coupon probing problem for any monotone submodular utility function.

Includes members:
  Member "no time to observe adaptive influence maximization with partial feedback":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a k hop collaborate game model adaptive strategy to maximize total revenue")
  Member "optimizing ad allocation in social advertising":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "approximation algorithms for coordinating ad campaigns on social networks")
  Member "locally adaptive optimization adaptive seeding for monotone submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "efficient approximation algorithms for adaptive seed minimization")
  Member "sketch based influence maximization and computation scaling up with guarantees":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rcelf a residual based approach for influence maximization problem")
  Member "submodular stochastic probing on matroids":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "learning optimal search algorithms from data")
  Member "a stochastic probing problem with applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning optimal search algorithms from data")
  Member "maximizing social influence in nearly optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "time constrained adaptive influence maximization")
  Member "adaptive submodularity theory and applications in active learning and stochastic optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "comprehensive and efficient data labeling via adaptive model scheduling")

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)