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 "a theory on power in networks"):
  Abstract: The eigenvector centrality equation $\lambda x = A \, x$ is a successful compromise between simplicity and expressivity. It claims that central actors are those connected with central others. For at least 70 years, this equation has been explored in disparate contexts, including econometrics, sociometry, bibliometrics, Web information retrieval, and network science. We propose an equally elegant counterpart: the power equation $x = A x^{\div}$, where $x^{\div}$ is the vector whose entries are the reciprocal of those of $x$. It asserts that power is in the hands of those connected with powerless others. It is meaningful, for instance, in bargaining situations, where it is advantageous to be connected to those who have few options. We tell the parallel, mostly unexplored story of this intriguing equation.

Includes members:
  Member "vulnerability and power on networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "critical nodes in directed networks")
  Member "pagerank standing on the shoulders of giants":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "trust evaluation mechanism for user recruitment in mobile crowd sensing in the internet of things")
  Member "bargaining dynamics in exchange networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "distributed resource management in systems of systems an architecture perspective")

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)