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 "programming with a differentiable forth interpreter"):
  Abstract: There are families of neural networks that can learn to compute any function, provided sufficient training data. However, given that in practice training data is scarce for all but a small set of problems, a core question is how to incorporate prior knowledge into a model. Here we consider the case of prior procedural knowledge such as knowing the overall recursive structure of a sequence transduction program or the fact that a program will likely use arithmetic operations on real numbers to solve a task. To this end we present a differentiable interpreter for the programming language Forth. Through a neural implementation of the dual stack machine that underlies Forth, programmers can write program sketches with slots that can be filled with learnable behaviour. As the program interpreter is end-to-end differentiable, we can optimize this behaviour directly through gradient descent techniques on user specified objectives, and also integrate the program into any larger neural computation graph. We show empirically that our interpreter is able to effectively leverage different levels of prior program structure and learn complex transduction tasks such as sequence sorting or addition with substantially less data and better generalisation over problem sizes. In addition, we introduce neural program optimisations based on symbolic computation and parallel branching that lead to significant speed improvements.

Includes members:
  Member "adaptive neural compilation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "learning compositional neural programs with recursive tree search and planning")
  Member "solving general arithmetic word problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equate a benchmark evaluation framework for quantitative reasoning in natural language inference")
  Member "terpret a probabilistic programming language for program induction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "why build an assistant in minecraft")
  Member "neural random access machines":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards modular algorithm induction")
  Member "neural programmer inducing latent programs with gradient descent":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "automl zero evolving machine learning algorithms from scratch")
  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 "neural module networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "relationship embedded representation learning for grounding referring expressions")
  Member "neural programmer interpreters":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "meta learning curiosity algorithms")

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)