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 "fundamentals of recurrent neural network rnn and long short term memory lstm network"):
  Abstract: Abstract   Because of their effectiveness in broad practical applications, LSTM networks have received a wealth of coverage in scientific journals, technical blogs, and implementation guides. However, in most articles, the inference formulas for the LSTM network and its parent, RNN, are stated axiomatically, while the training formulas are omitted altogether. In addition, the technique of “unrolling” an RNN is routinely presented without justification throughout the literature. The goal of this tutorial is to explain the essential RNN and LSTM fundamentals in a single document. Drawing from concepts in Signal Processing, we formally derive the canonical RNN formulation from differential equations. We then propose and prove a precise statement, which yields the RNN unrolling technique. We also review the difficulties with training the standard RNN and address them by transforming the RNN into the “Vanilla LSTM” 1   network through a series of logical arguments. We provide all equations pertaining to the LSTM system together with detailed descriptions of its constituent entities. Albeit unconventional, our choice of notation and the method for presenting the LSTM system emphasizes ease of understanding. As part of the analysis, we identify new opportunities to enrich the LSTM system and incorporate these extensions into the Vanilla LSTM network, producing the most general LSTM variant to date. The target reader has already been exposed to RNNs and LSTM networks through numerous available resources and is open to an alternative pedagogical approach. A Machine Learning practitioner seeking guidance for implementing our new augmented LSTM model in software for experimentation and research will find the insights and derivations in this treatise valuable as well.

Includes members:
  Member "latent odes for irregularly sampled time series":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scalable gradients for stochastic differential equations")
  Member "long short term memory as a dynamically computed element wise weighted sum":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "univse robust visual semantic embeddings via structured semantic representations")
  Member "stable architectures for deep neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a comprehensive and modularized statistical framework for gradient norm equality in deep neural networks")
  Member "deep neural networks motivated by partial differential equations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "advectivenet an eulerian lagrangian fluidic reservoir for point cloud processing")
  Member "neural ordinary differential equations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastic latent residual video prediction")
  Member "recent advances in recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey of optimization methods from a machine learning perspective")
  Member "nais net stable deep networks from non autonomous differential equations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "accelerating neural odes with spectral elements")
  Member "lstm a search space odyssey":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")

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.LG(Machine Learning)