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 "trend prediction in temporal bipartite networks the case of movielens netflix and digg"):
  Abstract: Online systems, where users purchase or collect items of some kind, can be effectively represented by temporal bipartite networks where both nodes and links are added with time. We use this representation to predict which items might become popular in the near future. Various prediction methods are evaluated on three distinct datasets originating from popular online services (Movielens, Netflix, and Digg). We show that the prediction performance can be further enhanced if the user social network is known and centrality of individual users in this network is used to weight their actions.

Includes members:
  Member "twitter mood predicts the stock market":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mining social media data for biomedical signals and health related behavior")
  Member "information contagion an empirical study of the spread of news on digg and twitter social networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "modeling information diffusion in online social networks with partial differential equations")
  Member "using a model of social dynamics to predict popularity of news":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "don t feed the troll detecting troll behavior via inverse reinforcement learning")
  Member "predicting the popularity of online content":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "online convex optimization for caching networks")
  Member "social networks that matter twitter under the microscope":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "consistent recovery threshold of hidden nearest neighbor graphs")

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)