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 "learning numeracy binary arithmetic with neural turing machines"):
  Abstract: One of the main problems encountered so far with recurrent neural networks is that they struggle to retain long-time information dependencies in their recurrent connections. Neural Turing Machines (NTMs) attempt to mitigate this issue by providing the neural network with an external portion of memory, in which information can be stored and manipulated later on. The whole mechanism is differentiable end-to-end, allowing the network to learn how to utilise this long-term memory via SGD. This allows NTMs to infer simple algorithms directly from data sequences. Nonetheless, the model can be hard to train due to a large number of parameters and interacting components and little related work is present. In this work we use a NTM to learn and generalise two arithmetical tasks: binary addition and multiplication. These tasks are two fundamental algorithmic examples in computer science, and are a lot more challenging than the previously explored ones, with which we aim to shed some light on the capabilities on this neural model.

Includes members:
  Member "implementing neural turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reservoir memory machines")
  Member "lie access neural turing machine":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "memory augmented recurrent neural networks can learn generalized dyck languages")
  Member "dynamic neural turing machine with soft and hard addressing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning to follow directions in street view")
  Member "learning simple algorithms from examples":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards modular algorithm induction")
  Member "deep learning in neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "π nets deep polynomial neural networks")
  Member "structured memory for neural turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "memory augmented recurrent networks for dialogue coherence")
  Member "neural gpus learn algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "accessing higher level representations in sequential transformers with feedback memory")
  Member "rmsprop and equilibrated adaptive learning rates for non convex optimization":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "domain independent dominance of adaptive methods")

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.NE(Neural and Evolutionary Computing)