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 "adaptive computation time for recurrent neural networks"):
  Abstract: This paper introduces Adaptive Computation Time (ACT), an algorithm that allows recurrent neural networks to learn how many computational steps to take between receiving an input and emitting an output. ACT requires minimal changes to the network architecture, is deterministic and differentiable, and does not add any noise to the parameter gradients. Experimental results are provided for four synthetic problems: determining the parity of binary vectors, applying binary logic operations, adding integers, and sorting real numbers. Overall, performance is dramatically improved by the use of ACT, which successfully adapts the number of computational steps to the requirements of the problem. We also present character-level language modelling results on the Hutter prize Wikipedia dataset. In this case ACT does not yield large gains in performance; however it does provide intriguing insight into the structure of the data, with more computation allocated to harder-to-predict transitions, such as spaces between words and ends of sentences. This suggests that ACT or other adaptive computation methods could provide a generic method for inferring segment boundaries in sequence data.

Includes members:
  Member "attend infer repeat fast scene understanding with generative models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "blockgan learning 3d object aware scene representations from unlabelled images")
  Member "conditional computation in neural networks for faster models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "attention over parameters for dialogue systems")
  Member "end to end memory networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning video object segmentation from unlabeled videos")
  Member "learning to transduce with unbounded memory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "arma nets expanding receptive field for dense prediction")
  Member "neural programmer interpreters":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "meta learning curiosity algorithms")
  Member "draw a recurrent neural network for image generation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "twostreamvan improving motion modeling in video generation")
  Member "training very deep networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "discrimination aware network pruning for deep model compression")

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)