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 "properties of a projected network of a bipartite network"):
  Abstract: Bipartite Graph is often a realistic model of complex networks where two different sets of entities are involved and relationship exist only two entities belonging to two different sets. Examples include the user-item relationship of a recommender system, actor-movie relationship of an online movie database systems. One way to compress a bipartite graph is to take unweighted or weighted one mode projection of one side vertices. Properties of this projected network are extremely important in many practical situations (say the selection process of influencing nodes for viral marketing). In this paper, we have studied the topological properties for projected network and some theoretical results are proved including the presence of cliques, connectedness for unweighted projection and maximum edge weight for weighted projected network.

Includes members:
  Member "diffusion like recommendation with enhanced similarity of objects":
    also connected through other hyperedges:
      (none)
  Member "the role of social networks in information diffusion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep learning approach on information diffusion in heterogeneous 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)