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 "computing a score of navigability in large graphs"):
  Abstract: The groundbreaking experiment of Travers and Milgram demonstrated the so-called "six degrees of separation" phenomenon, by which any individual in the world is able to contact an arbitrary, hitherto-unknown, individual by means of a short chain of social ties. Despite the large number of empirical and theoretical studies to explain the Travers-Milgram experiment, some fundamental questions are still open: why some individuals are more likely than others to discover short friend-of-a-friend communication chains? Can we rank individuals on the basis of their ability to discover short chains? To answer these questions, we extend the concept of potential gain, originally defined in the context of Web analysis, to social networks and we define a novel index, called "the navigability score," that ranks nodes in a network on the basis of how their position facilitates the discover of short chains that connect to arbitrary target nodes in the network. We define two variants of potential gain, called the geometric and the exponential potential gain, and present fast algorithms to compute them. Our theoretical and experimental analysis proves that the computation of the geometric and exponential gain are affordable even on large real-life graphs.

Includes members:
  Member "axioms for centrality":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "maximizing influence based group shapley centrality")
  Member "total communicability as a centrality measure":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nonlocal pagerank")
  Member "search in power law networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a general centrality framework based on node navigability")

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)