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 "link formation in egocentric networks impacts of local degrees and implications for link recommendation"):
  Abstract: Understanding mechanisms driving link formation in social networks is a long-standing problem that has implications to understanding social structure as well as link prediction and recommendation. Social networks exhibit a high degree of transitivity, which explains the successes of common neighbor-based methods for link prediction. In this paper, we examine mechanisms behind link formation from the perspective of an ego node. We find that the local degree of a neighbor node of the ego, which is the number of other neighbors the neighbor is connected to, plays a pivotal role in link formation. Specifically, neighbors with higher local degree are more likely to lead to new link formations when they serve as common neighbors with other nodes in the 2-hop egocentric network, both in undirected and directed settings. This is opposite of the finding of Adamic and Adar that neighbor nodes with higher global degree, which is the degree of that node in the entire network, are less likely to lead to new link formations. Furthermore, we demonstrate that incorporating local degree into common neighbor-based link predictors leads to more accurate link recommendations for the ego node, particularly for the highest-ranked recommendations.

Includes members:
  Member "evaluating link prediction methods":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "network representation learning for link prediction are we improving upon simple heuristics")
  Member "discovering social circles in ego networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "relational thematic clustering with mutually preferred neighbors")
  Member "evolution of social attribute networks measurements modeling and implications using google":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "defending against machine learning based inference attacks via adversarial examples opportunities and challenges")
  Member "social dynamics of digg":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep collaborative embedding for information cascade prediction")
  Member "supervised random walks predicting and recommending links in social networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "few shot learning on graphs via super classes based on graph spectral measures")

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)