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 "lie access neural turing machine"):
  Abstract: Following the recent trend in explicit neural memory structures, we present a new design of an external memory, wherein memories are stored in an Euclidean key space $\mathbb R^n$. An LSTM controller performs read and write via specialized read and write heads. It can move a head by either providing a new address in the key space (aka random access) or moving from its previous position via a Lie group action (aka Lie access). In this way, the "L" and "R" instructions of a traditional Turing Machine are generalized to arbitrary elements of a fixed Lie group action. For this reason, we name this new model the Lie Access Neural Turing Machine, or LANTM. #R##N#We tested two different configurations of LANTM against an LSTM baseline in several basic experiments. We found the right configuration of LANTM to outperform the baseline in all of our experiments. In particular, we trained LANTM on addition of $k$-digit numbers for $2 \le k \le 16$, but it was able to generalize almost perfectly to $17 \le k \le 32$, all with the number of parameters 2 orders of magnitude below the LSTM baseline.

Includes members:
  Member "associative long short term memory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "deep quaternion features for privacy protection")
  Member "key value memory networks for directly reading documents":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attention over parameters for dialogue systems")
  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 "end to end memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "learning video object segmentation from unlabeled videos")
  Member "neural random access machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards modular algorithm induction")
  Member "learning to transduce with unbounded memory":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "encoding based memory modules for recurrent neural networks")
  Member "grid long short term memory":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "arma nets expanding receptive field for dense prediction")
  Member "structured memory for neural turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "memory augmented recurrent networks for dialogue coherence")

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)