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 "on adaptivity gaps of influence maximization under the independent cascade model with full adoption feedback"):
  Abstract: In this paper, we study the adaptivity gap of the influence maximization problem under independent cascade model when full-adoption feedback is available. Our main results are to derive upper bounds on several families of well-studied influence graphs, including in-arborescences, out-arborescences and bipartite graphs. Especially, we prove that the adaptivity gap for the in-arborescence is between $[\frac{e}{e-1}, \frac{2e}{e - 1}]$ and for the out-arborescence, the gap is between $[\frac{e}{e-1}, 2]$. These are the first constant upper bounds in the full-adoption feedback model. We provide several novel ideas to tackle with correlated feedback appearing in the adaptive stochastic optimization, which we believe to be of independent interests.

Includes members:
  Member "near optimal adaptivity gaps for stochastic multi value probing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "pandora s box problem with order constraints")
  Member "adaptive influence maximization with myopic feedback":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "time constrained adaptive influence maximization")
  Member "beyond adaptive submodularity approximation guarantees of greedy policy with adaptive submodularity ratio":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "time constrained adaptive influence maximization")
  Member "multi round influence maximization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "time constrained adaptive influence maximization")
  Member "adaptive submodular influence maximization with myopic feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time constrained adaptive influence maximization")
  Member "adaptive influence maximization in dynamic social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "time constrained adaptive influence maximization")
  Member "adaptivity gaps for stochastic probing submodular and xos functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pandora s box problem with order constraints")
  Member "boosting information spread an algorithmic approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "diversifying seeds and audience in social influence maximization")

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)