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 "spectrum enhanced pairwise learning to rank"):
  Abstract: To enhance the performance of the recommender system, side information is extensively explored with various features (e.g., visual features and textual features). However, there are some demerits of side information: (1) the extra data is not always available in all recommendation tasks; (2) it is only for items, there is seldom high-level feature describing users. To address these gaps, we introduce the spectral features extracted from two hypergraph structures of the purchase records. Spectral features describe the \textit{similarity} of users/items in the graph space, which is critical for recommendation. We leverage spectral features to model the users' preference and items' properties by incorporating them into a Matrix Factorization (MF) model. In addition to modeling, we also use spectral features to optimize. Bayesian Personalized Ranking (BPR) is extensively leveraged to optimize models in implicit feedback data. However, in BPR, all missing values are regarded as negative samples equally while many of them are indeed unseen positive ones. We enrich the positive samples by calculating the similarity among users/items by the spectral features. The key ideas are: (1) similar users shall have similar preference on the same item; (2) a user shall have similar perception on similar items. Extensive experiments on two real-world datasets demonstrate the usefulness of the spectral features and the effectiveness of our spectrum-enhanced pairwise optimization. Our models outperform several state-of-the-art models significantly.

Includes members:
  Member "outer product based neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sequential recommendation with dual side neighbor based collaborative relation modeling")
  Member "spectral collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "revisiting graph based collaborative filtering a linear residual graph convolutional network approach")
  Member "aesthetic based clothing recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "modeling embedding dimension correlations via convolutional neural collaborative filtering")
  Member "nais neural attentive item similarity model for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "neural factorization machines for sparse predictive analytics":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parameter efficient transfer from sequential behaviors for user profiling and recommendation")
  Member "neural collaborative filtering":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "advances in collaborative filtering and ranking")
  Member "fast matrix factorization for online recommendation with implicit feedback":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to hash with graph neural networks for recommender systems")
  Member "fast eigenspace approximation using random signals":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximating spectral clustering via sampling a review")

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)