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 "revisiting graph based collaborative filtering a linear residual graph convolutional network approach"):
  Abstract: Graph Convolutional Networks (GCNs) are state-of-the-art graph based representation learning models by iteratively stacking multiple layers of convolution aggregation operations and non-linear activation operations. Recently, in Collaborative Filtering (CF) based Recommender Systems (RS), by treating the user-item interaction behavior as a bipartite graph, some researchers model higher-layer collaborative signals with GCNs. These GCN based recommender models show superior performance compared to traditional works. However, these models suffer from training difficulty with non-linear activations for large user-item graphs. Besides, most GCN based models could not model deeper layers due to the over smoothing effect with the graph convolution operation. In this paper, we revisit GCN based CF models from two aspects. First, we empirically show that removing non-linearities would enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we propose a residual network structure that is specifically designed for CF with user-item interaction modeling, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse user-item interaction data. The proposed model is a linear model and it is easy to train, scale to large datasets, and yield better efficiency and effectiveness on two real datasets. We publish the source code at this https URL.

Includes members:
  Member "a neural influence diffusion model for social recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "t gcn a temporal graph convolutional network for traffic prediction":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "adargcn adaptive aggregation gcn for few shot learning")
  Member "simplifying graph convolutional networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "transferring robustness for graph neural network against poisoning attacks")
  Member "graph convolutional neural networks for web scale recommender systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on the expressive power of graph neural networks")
  Member "predict then propagate graph neural networks meet personalized pagerank":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bridging the gap between spatial and spectral domains a survey on graph neural networks")
  Member "deeper insights into graph convolutional networks for semi supervised learning":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "memory based graph networks")
  Member "spectral collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "basconv aggregating heterogeneous interactions for basket recommendation with graph convolutional neural network")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "advances in collaborative filtering and ranking")

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.IR(Information Retrieval)