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 "rotational unit of memory"):
  Abstract: The concepts of unitary evolution matrices and associative memory have boosted the field of Recurrent Neural Networks (RNN) to state-of-the-art performance in a variety of sequential tasks. However, RNN still have a limited capacity to manipulate long-term memory. To bypass this weakness the most successful applications of RNN use external techniques such as attention mechanisms. In this paper we propose a novel RNN model that unifies the state-of-the-art approaches: Rotational Unit of Memory (RUM). The core of RUM is its rotational operation, which is, naturally, a unitary matrix, providing architectures with the power to learn long-term dependencies by overcoming the vanishing and exploding gradients problem. Moreover, the rotational unit also serves as associative memory. We evaluate our model on synthetic memorization, question answering and language modeling tasks. RUM learns the Copying Memory task completely and improves the state-of-the-art result in the Recall task. RUM's performance in the bAbI Question Answering task is comparable to that of models with attention mechanism. We also improve the state-of-the-art result to 1.189 bits-per-character (BPC) loss in the Character Level Penn Treebank (PTB) task, which is to signify the applications of RUM to real-world sequential data. The universality of our construction, at the core of RNN, establishes RUM as a promising approach to language modeling, speech recognition and machine translation.

Includes members:
  Member "gated orthogonal recurrent units on learning to forget":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "generating high fidelity synthetic time series datasets with doppelganger")
  Member "fast slow recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "autofoley artificial synthesis of synchronized sound tracks for silent videos with deep learning")
  Member "on orthogonality and learning recurrent networks with long term dependencies":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "concept whitening for interpretable image recognition")
  Member "learning to update auto associative memory in recurrent neural networks for improving sequence memorization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self attentive associative memory")
  Member "recurrent highway networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "pay attention to the activations a modular attention mechanism for fine grained image recognition")
  Member "recurrent orthogonal networks and long memory tasks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "refined gate a simple and effective gating mechanism for recurrent units")
  Member "neural architecture search with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "zoneout regularizing rnns by randomly preserving hidden activations":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "prophetnet predicting future n gram for sequence to sequence pre training")

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)