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 "influence maximization over markovian graphs a stochastic optimization approach"):
  Abstract: This paper considers the problem of randomized influence maximization over a Markovian graph process: given a fixed set of nodes whose connectivity graph is evolving as a Markov chain, estimate the probability distribution (over this fixed set of nodes) that samples a node which will initiate the largest information cascade (in expectation). Further, it is assumed that the sampling process affects the evolution of the graph i.e. the sampling distribution and the transition probability matrix are functionally dependent. In this setup, recursive stochastic optimization algorithms are presented to estimate the optimal sampling distribution for two cases: 1) transition probabilities of the graph are unknown but, the graph can be observed perfectly 2) transition probabilities of the graph are known but, the graph is observed in noise. These algorithms consist of a neighborhood size estimation algorithm combined with a variance reduction method, a Bayesian filter and a stochastic gradient algorithm. Convergence of the algorithms are established theoretically and, numerical results are provided to illustrate how the algorithms work.

Includes members:
  Member "what do your friends think efficient polling methods for networks using friendship paradox":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "scalable methods for adaptively seeding a social network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "time constrained adaptive influence maximization")
  Member "exact recovery in the stochastic block model":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "renyi entropy bounds on the active learning cost performance tradeoff")
  Member "interactive sensing and decision making in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "information diffusion in social networks friendship paradox based models and statistical inference")
  Member "influence maximization in continuous time diffusion networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "black box submodular maximization discrete and continuous settings")
  Member "uncovering the temporal dynamics of diffusion networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "information spreading in stationary markovian evolving graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "how fast can we reach a target vertex in stochastic temporal graphs")

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)