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 "sparse neural attentive knowledge based models for grade prediction"):
  Abstract: Grade prediction for future courses not yet taken by students is important as it can help them and their advisers during the process of course selection as well as for designing personalized degree plans and modifying them based on their performance. One of the successful approaches for accurately predicting a student's grades in future courses is Cumulative Knowledge-based Regression Models (CKRM). CKRM learns shallow linear models that predict a student's grades as the similarity between his/her knowledge state and the target course. A student's knowledge state is built by linearly accumulating the learned provided knowledge components of the courses he/she has taken in the past, weighted by his/her grades in them. However, not all the prior courses contribute equally to the target course. In this paper, we propose a novel Neural Attentive Knowledge-based model (NAK) that learns the importance of each historical course in predicting the grade of a target course. Compared to CKRM and other competing approaches, our experiments on a large real-world dataset consisting of $\sim$1.5 grades show the effectiveness of the proposed NAK model in accurately predicting the students' grades. Moreover, the attention weights learned by the model can be helpful in better designing their degree plans.

Includes members:
  Member "ale additive latent effect models for grade prediction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "context aware non linear and neural attentive knowledge based models for grade prediction")
  Member "nais neural attentive item similarity model for recommendation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "lightgcn simplifying and powering graph convolution network for recommendation")
  Member "on controllable sparse alternatives to softmax":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "scaling up multiagent reinforcement learning for robotic systems learn an adaptive sparse communication graph")
  Member "neural factorization machines for sparse predictive analytics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameter efficient transfer from sequential behaviors for user profiling and recommendation")
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "grade prediction with temporal course wise influence":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "context aware non linear and neural attentive knowledge based models for grade prediction")
  Member "attentional factorization machines learning the weight of feature interactions via attention networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "chameleon a deep learning meta architecture for news recommender systems phd thesis")
  Member "from softmax to sparsemax a sparse model of attention and multi label classification":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "power bert accelerating bert inference for classification tasks")

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.CY(Computers and Society)