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 new method k method of calculating the mutual influence of nodes indirected weight complex networks"):
  Abstract: Abstract   New method (the K-method) for calculation of characteristics of complex networks is proposed. The method is based on transformation of the initial network and subsequent application of the Kirchhoff rules. The field of application of the method for sparse networks (in which nodes have a cause–effect character of the so-called ”cognitive maps”) is proposed. Two new characteristics of concept nodes (”pressure” and ”influence”) having a semantic interpretation are proposed. The advantages of the proposed K-method include its computational simplicity (in comparison with other known algorithms) comparable with the task of enumerating subgraphs for sparse networks of relatively small size (in practice — several hundred nodes). At the same time, the results obtained with the help of the K-method for a real network are correlating well enough with the results obtained using the impulse method.

Includes members:
  Member "control principles of complex networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nonlinearity networks a 2020 vision")
  Member "probing the topological properties of complex networks modeling short written texts":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using word embeddings to improve the discriminability of co occurrence text networks")

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)