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 "dynamic key value memory networks for knowledge tracing"):
  Abstract: Knowledge Tracing (KT) is a task of tracing evolving knowledge state of students with respect to one or more concepts as they engage in a sequence of learning activities. One important purpose of KT is to personalize the practice sequence to help students learn knowledge concepts efficiently. However, existing methods such as Bayesian Knowledge Tracing and Deep Knowledge Tracing either model knowledge state for each predefined concept separately or fail to pinpoint exactly which concepts a student is good at or unfamiliar with. To solve these problems, this work introduces a new model called Dynamic Key-Value Memory Networks (DKVMN) that can exploit the relationships between underlying concepts and directly output a student's mastery level of each concept. Unlike standard memory-augmented neural networks that facilitate a single memory matrix or two static memory matrices, our model has one static matrix called key, which stores the knowledge concepts and the other dynamic matrix called value, which stores and updates the mastery levels of corresponding concepts. Experiments show that our model consistently outperforms the state-of-the-art model in a range of KT datasets. Moreover, the DKVMN model can automatically discover underlying concepts of exercises typically performed by human annotations and depict the changing knowledge state of a student.

Includes members:
  Member "how deep is knowledge tracing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "domain adaption for knowledge tracing")
  Member "key value memory networks for directly reading documents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attention over parameters for dialogue systems")
  Member "matching networks for one shot learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "end to end memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning video object segmentation from unlabeled videos")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "π nets deep polynomial neural networks")
  Member "learning to transduce with unbounded memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "encoding based memory modules for recurrent neural networks")
  Member "inferring algorithmic patterns with stack augmented recurrent nets":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "accessing higher level representations in sequential transformers with feedback memory")
  Member "mxnet a flexible and efficient machine learning library for heterogeneous distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "attention guided chained context aggregation for semantic segmentation")

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.AI(Artificial Intelligence)