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 "movie rating prediction using content based and link stream features"):
  Abstract: While graph-based collaborative filtering recommender systems have been introduced several years ago, there are still several shortcomings to deal with, the temporal information being one of the most important. The new link stream paradigm is aiming at extending graphs for correctly modelling the graph dynamics, without losing crucial information. We investigate the impact of such link stream features for recommender systems. by designing link stream features, that capture the intrinsic structure and dynamics of the data. We show that such features encode a fine-grained and subtle description of the underlying recommender system. Focusing on a traditional recommender system context, the rating prediction on the MovieLens20M dataset, we input these features along with some content-based ones into a gradient boosting machine (XGBoost) and show that it outperforms significantly a sole content-based solution. These encouraging results call for further exploration of this original modelling and its integration to complete state-of-the-art recommender systems algorithms. Link streams and graphs, as natural visualizations of recommender systems, can offer more interpretability in a time when algorithm transparency is an increasingly important topic of discussion. We also hope to sparkle interesting discussions in the community about the links between link streams and tensor factorization methods: indeed, they are two sides of the same object.

Includes members:
  Member "stream graphs and link streams for the modeling of interactions over time":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "finding temporal patterns using algebraic fingerprints")
  Member "recsys challenge 2016 job recommendations based on preselection of offers and gradient boosting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "privatejobmatch a privacy oriented deferred multi match recommender system for stable employment")
  Member "enumerating maximal cliques in temporal graphs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "span core decomposition for temporal networks algorithms and applications")
  Member "an algebraic approach to temporal network analysis based on temporal quantities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "degree based outlier detection within ip traffic modelled as a link stream")

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)