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 "automated curriculum learning for neural networks"):
  Abstract: We introduce a method for automatically selecting the path, or syllabus, that a neural network follows through a curriculum so as to maximise learning efficiency. A measure of the amount that the network learns from each data sample is provided as a reward signal to a nonstationary multi-armed bandit algorithm, which then determines a stochastic syllabus. We consider a range of signals derived from two distinct indicators of learning progress: rate of increase in prediction accuracy, and rate of increase in network complexity. Experimental results for LSTM networks on three curricula demonstrate that our approach can significantly accelerate learning, in some cases halving the time required to attain a satisfactory performance level.

Includes members:
  Member "vime variational information maximizing exploration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explore discover and learn unsupervised discovery of state covering skills")
  Member "learning the curriculum with bayesian optimization for task specific word representation learning":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "learning from easy to complex adaptive multi curricula learning for neural dialogue generation")
  Member "towards ai complete question answering a set of prerequisite toy tasks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a 3 accelerating attention mechanisms in neural networks with approximation")
  Member "neural programmer interpreters":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "meta learning curiosity algorithms")
  Member "neural turing machines":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "mast a memory augmented self supervised tracker")
  Member "learning to execute":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "curriculum by texture")
  Member "generating sequences with recurrent neural networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "using a thousand optimization tasks to learn hyperparameter search strategies")
  Member "regret analysis of stochastic and nonstochastic multi armed bandit problems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "multi source domain adaptation for text classification via distancenet bandits")

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)