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 "recurrent additive networks"):
  Abstract: We introduce recurrent additive networks (RANs), a new gated RNN which is distinguished by the use of purely additive latent state updates. At every time step, the new state is computed as a gated component-wise sum of the input and the previous state, without any of the non-linearities commonly used in RNN transition dynamics. We formally show that RAN states are weighted sums of the input vectors, and that the gates only contribute to computing the weights of these sums. Despite this relatively simple functional form, experiments demonstrate that RANs perform on par with LSTMs on benchmark language modeling problems. This result shows that many of the non-linear computations in LSTMs and related networks are not essential, at least for the problems we consider, and suggests that the gates are doing more of the computational work than previously understood.

Includes members:
  Member "attention is all you need":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "multiplicative lstm for sequence modelling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transformer xl attentive language models beyond a fixed length context")
  Member "long short term memory networks for machine reading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "time aware large kernel convolutions")
  Member "a decomposable attention model for natural language inference":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "neural architecture search with reinforcement learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "exploring the limits of language modeling":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on contextual embeddings")
  Member "recurrent batch normalization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rethinking batch normalization in transformers")
  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)