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 "snap a general purpose network analysis and graph mining library"):
  Abstract: Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. #R##N#Here, we describe Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy to use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs where nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and meta-data on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic, they can be modified during the computation at low cost. SNAP is provided as an open source library in C++ as well as a module in Python. #R##N#We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.

Includes members:
  Member "personalized pagerank estimation and search a bidirectional approach":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "empirical policy evaluation with supergraphs")
  Member "ringo interactive graph analytics on big memory machines":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adaptive low level storage of very large knowledge graphs")
  Member "network lasso clustering and optimization in large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "neural generators of sparse local linear models for achieving both accuracy and interpretability")
  Member "fast ppr scaling personalized pagerank estimation for large graphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "efficient algorithms for approximate single source personalized pagerank queries")
  Member "nonparametric multi group membership model for dynamic networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "query based interactive recommendation by meta path and adapted attention gru")
  Member "community detection in networks with node attributes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "discovering social circles in ego networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relational thematic clustering with mutually preferred neighbors")
  Member "structure and dynamics of information pathways in online media":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "learning mixtures of graphs from epidemic cascades")

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)