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 "skip thought memory networks"):
  Abstract: Question Answering (QA) is fundamental to natural language processing in that most nlp problems can be phrased as QA (Kumar et al., 2015). Current weakly supervised memory network models that have been proposed so far struggle at answering questions that involve relations among multiple entities (such as facebook's bAbi qa5-three-arg-relations in (Weston et al., 2015)). To address this problem of learning multi-argument multi-hop semantic relations for the purpose of QA, we propose a method that combines the jointly learned long-term read-write memory and attentive inference components of end-to-end memory networks (MemN2N) (Sukhbaatar et al., 2015) with distributed sentence vector representations encoded by a Skip-Thought model (Kiros et al., 2015). This choice to append Skip-Thought Vectors to the existing MemN2N framework is motivated by the fact that Skip-Thought Vectors have been shown to accurately model multi-argument semantic relations (Kiros et al., 2015).

Includes members:
  Member "end to end memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning video object segmentation from unlabeled videos")
  Member "towards neural network based reasoning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi relational question answering from narratives machine reading and reasoning in simulated worlds")
  Member "skip thought vectors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on contextual embeddings")
  Member "towards ai complete question answering a set of prerequisite toy tasks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "ask me anything dynamic memory networks for natural language processing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mast a memory augmented self supervised tracker")
  Member "neural turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mast a memory augmented self supervised tracker")
  Member "empirical evaluation of gated recurrent neural networks on sequence modeling":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "adadelta an adaptive learning rate method":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hyper parameter optimization a review of algorithms and applications")

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)