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 "restricted recurrent neural tensor networks"):
  Abstract: Increasing the capacity of recurrent neural networks (RNN) usually involves augmenting the size of the hidden layer, resulting in a significant increase of computational cost. An alternative is the recurrent neural tensor network (RNTN), which increases capacity by employing distinct hidden layer weights for each vocabulary word. The disadvantage of RNTNs is that memory usage scales linearly with vocabulary size, which can reach millions for word-level language models. In this paper, we introduce restricted recurrent neural tensor networks (r-RNTN) which reserve distinct hidden layer weights for frequent vocabulary words while sharing a single set of weights for infrequent words. Perplexity evaluations using the Penn Treebank corpus show that r-RNTNs improve language model performance over standard RNNs using only a small fraction of the parameters of unrestricted RNTNs.

Includes members:
  Member "outrageously large neural networks the sparsely gated mixture of experts layer":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "attention over parameters for dialogue systems")
  Member "on the state of the art of evaluation in neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "regularizing and optimizing lstm language models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the implicit and explicit regularization effects of dropout")
  Member "exploring the limits of language modeling":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on contextual embeddings")
  Member "conditional computation in neural networks for faster models":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "attention over parameters for dialogue systems")
  Member "strategies for training large vocabulary neural language models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "pre training tasks for embedding based large scale retrieval")
  Member "modeling compositionality with multiplicative recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "logic and the 2 simplicial transformer")
  Member "recurrent neural network regularization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the implicit and explicit regularization effects of dropout")

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.CL(Computation and Language)