human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "next term student performance prediction a recommender systems approach"
  Abstract: An enduring issue in higher education is student retention to successful graduation. National statistics indicate that most higher education institutions have four-year degree completion rates around 50%, or just half of their student populations. While there are prediction models which illuminate what factors assist with college student success, interventions that support course selections on a semester-to-semester basis have yet to be deeply understood. To further this goal, we develop a system to predict students’ grades in the courses they will enroll in during the next enrollment term by learning patterns from historical transcript data coupled with additional information about students, courses and the instructors teaching them. We explore a variety of classic and state-of-the-art techniques which have proven effective for recommendation tasks in the e-commerce domain. In our experiments, Factorization Machines (FM), Random Forests (RF), and the Personalized Multi-Linear Regression model achieve the lowest prediction error. Application of a novel feature selection technique is key to the predictive success and interpretability of the FM. By comparing feature importance across populations and across models, we uncover strong connections between instructor characteristics and student performance. We also discover key differences between transfer and non-transfer students. Ultimately we find that a hybrid FM-RF method can be used to accurately predict grades for both new and returning students taking both new and existing courses. Application of these techniques holds promise for student degree planning, instructor interventions, and personalized advising, all of which could improve retention and academic performance.

Connected through hyperedge HE-1 (induced by source paper "sparse neural attentive knowledge based models for grade prediction"):
  with members:
    - "ale additive latent effect models for grade prediction"
    - "nais neural attentive item similarity model for recommendation"
    - "on controllable sparse alternatives to softmax"
    - "neural factorization machines for sparse predictive analytics"
    - "attention is all you need"
    - "grade prediction with temporal course wise influence"
    - "attentional factorization machines learning the weight of feature interactions via attention networks"
    - "from softmax to sparsemax a sparse model of attention and multi label classification"

Connected through hyperedge HE-2 (induced by source paper "academic performance estimation with attention based graph convolutional networks"):
  with members:
    - "reliable deep grade prediction with uncertainty estimation"
    - "spatial temporal graph convolutional networks for skeleton based action recognition"
    - "gritnet student performance prediction with deep learning"
    - "dynamic graph cnn for learning on point clouds"
    - "diffusion convolutional recurrent neural network data driven traffic forecasting"
    - "grade prediction with temporal course wise influence"
    - "feed forward networks with attention can solve some long term memory problems"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-3 (induced by source paper "reliable deep grade prediction with uncertainty estimation"):
  with members:
    - "improving palliative care with deep learning"
    - "grade prediction with temporal course wise influence"
    - "why should i trust you explaining the predictions of any classifier"
    - "understanding neural networks through representation erasure"
    - "grade prediction with course and student specific models"
    - "adam a method for stochastic optimization"

Connected through hyperedge HE-4 (induced by source paper "grade prediction with temporal course wise influence"):
  with members:
    - "dynamic matrix factorization a state space approach"

Question: Please tell me which class the center node 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)