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 "disagreement and polarization in two party social networks"):
  Abstract: We investigate disagreement and polarization in a social network with two polarizing sources of information. First, we define disagreement and polarization indices in two-party leader-follower models of opinion dynamics. We then give expressions for the indices in terms of a graph Laplacian. The expressions show a relationship between these quantities and the concepts of resistance distance and biharmonic distance. We next study the problem of designing the network so as to minimize disagreement and polarization. We give conditions for optimal disagreement and polarization, and further, we show that a linear combination of disagreement and polarization of the follower nodes is a convex function of the edge weights between followers. We propose algorithms to address some related continuous and discrete optimization problems and also present analytic results for some interesting examples.

Includes members:
  Member "shifting opinions in a social network through leader selection":
    also connected through other hyperedges:
      (none)
  Member "opinion dynamics with varying susceptibility to persuasion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "minimizing polarization and disagreement in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "opinion maximization in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "angry birds flock together aggression propagation on social media")
  Member "opinion fluctuations and disagreement in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "shifting opinions in a social network through leader selection")
  Member "twice ramanujan sparsifiers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sketching transformed matrices with applications to natural language processing")

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)