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 "exploiting social influence to control elections based on scoring rules"):
  Abstract: Online social networks are used to diffuse opinions and ideas among users, enabling a faster communication and a wider audience. The way in which opinions are conditioned by social interactions is usually called social influence. Social influence is extensively used during political campaigns to advertise and support candidates. Herein we consider the problem of exploiting social influence in a network of voters in order to change their opinion about a target candidate with the aim of increasing his chance to win/lose the election in a wide range of voting systems.  We introduce the Linear Threshold Ranking, a natural and powerful extension of the well-established Linear Threshold Model, which describes the change of opinions taking into account the amount of exercised influence. We are able to maximize the score of a target candidate up to a factor of $1-1/e$ by showing submodularity. We exploit such property to provide a $\frac{1}{3}(1-1/e)$-approximation algorithm for the constructive election control problem. Similarly, we get a $\frac{1}{2}(1-1/e)$-approximation ratio in the destructive scenario. The algorithm can be used in arbitrary scoring rule voting systems, including plurality rule and borda count. Finally, we perform an experimental study on real-world networks, measuring Probability of Victory (PoV) and Margin of Victory (MoV) of the target candidate, to validate the model and to test the capability of the algorithm.

Includes members:
  Member "defending elections against malicious spread of misinformation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "persuading voters it s easy to whisper it s hard to speak loud")
  Member "disinformation and social bot operations in the run up to the 2017 french presidential election":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")
  Member "controlling elections through social influence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "election manipulation on social networks seeding edge removal edge addition")
  Member "complexity of shift bribery in committee elections":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the complexity of destructive bribery in approval based multi winner voting")
  Member "influence maximization near optimal time complexity meets practical efficiency":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "time constrained adaptive influence maximization")
  Member "minority becomes majority in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "election manipulation on social networks seeding edge removal edge addition")
  Member "anyone but him the complexity of precluding an alternative":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "selecting voting locations for fun and profit")

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)