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 "shifting opinions in a social network through leader selection"):
  Abstract: We study French-Degroot opinion dynamics in a social network with two polarizing parties. We consider a network in which the leaders of one party are given, and we pose the problem of selecting the leader set of the opposing party so as to shift the average opinion to a desired value. This problem generalizes the intensely studied problem of influence maximization. When each party has only one leader, we express the average opinion in terms of the Laplacian matrix of the network. The analysis shows balance of influence between the two leader nodes. We show that the problem of selecting at most $k$ completely stubborn leaders to shift the average opinion is $\mathbf{NP}$-hard. Then, we reduce the problem to a problem of submodular maximization with submodular knapsack constraint and additional cardinality constraint, and propose a greedy algorithm with upper bound search to approximate the optimum solution. We also conduct experiments in random networks and real-world networks to show the effectiveness of the algorithm.

Includes members:
  Member "current flow group closeness centrality for complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a distributed laplacian solver and its applications to electrical flow and random spanning tree computation")
  Member "opinion dynamics with varying susceptibility to persuasion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "network disruption maximizing disagreement and polarization in social networks")
  Member "opinion dynamics with stubborn agents":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "disagreement and polarization in two party social networks")
  Member "minimizing polarization and disagreement in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "choice set optimization under discrete choice models of group decisions")
  Member "from local averaging to emergent global behaviors the fundamental role of network interconnections":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "disagreement and polarization in two party social networks")
  Member "opinion maximization in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "angry birds flock together aggression propagation on social media")
  Member "an efficient parallel solver for sdd linear systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "circulation control for faster minimum cost flow in unit capacity graphs")
  Member "submodular optimization with submodular cover and submodular knapsack constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust submodular minimization with applications to cooperative modeling")

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)