human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "from statistical relational to neuro symbolic artificial intelligence"):
  with members:
    - "relational neural machines"
    - "neural logic machines"
    - "differentiable reasoning on large knowledge bases and natural language"
    - "playgol learning programs through play"
    - "neural symbolic computing an effective methodology for principled integration of machine learning and reasoning"
    - "learning to reason leveraging neural networks for approximate dnf counting"
    - "synthesizing datalog programs using numerical relaxation"
    - "learning relational representations with auto encoding logic programs"

Connected through hyperedge HE-2 (induced by source paper "why build an assistant in minecraft"):
  with members:
    - "craftassist a framework for dialogue enabled interactive agents"
    - "habitat a platform for embodied ai research"
    - "learning from dialogue after deployment feed yourself chatbot"
    - "babyai a platform to study the sample efficiency of grounded language learning"
    - "seq2sql generating structured queries from natural language using reinforcement learning"
    - "babyai first steps towards grounded language learning with a human in the loop"
    - "towards deep conversational recommendations"
    - "learning to ask questions in open domain conversational systems with typed decoders"

Connected through hyperedge HE-3 (induced by source paper "tabfact a large scale dataset for table based fact verification"):
  with members:
    - "learning to generalize from sparse and underspecified rewards"
    - "xlnet generalized autoregressive pretraining for language understanding"
    - "superglue a stickier benchmark for general purpose language understanding systems"
    - "roberta a robustly optimized bert pretraining approach"
    - "seq2sql generating structured queries from natural language using reinforcement learning"
    - "ukp athene multi sentence textual entailment for claim verification"
    - "glue a multi task benchmark and analysis platform for natural language understanding"
    - "a corpus for reasoning about natural language grounded in photographs"

Connected through hyperedge HE-4 (induced by source paper "learning compositional neural programs with recursive tree search and planning"):
  with members:
    - "learning to infer program sketches"
    - "hierarchical reinforcement learning via advantage weighted information maximization"
    - "a meta transfer objective for learning to disentangle causal mechanisms"
    - "ranked reward enabling self play reinforcement learning for combinatorial optimization"
    - "hierarchical reinforcement learning with hindsight"
    - "near optimal representation learning for hierarchical reinforcement learning"
    - "improving the universality and learnability of neural programmer interpreters with combinator abstraction"
    - "fast context adaptation via meta learning"

Connected through hyperedge HE-5 (induced by source paper "differentiable reasoning on large knowledge bases and natural language"):
  with members:
    - "nlprolog reasoning with weak unification for question answering in natural language"
    - "towards neural theorem proving at scale"
    - "a survey on open information extraction"
    - "learning explanatory rules from noisy data"
    - "differentiable learning of logical rules for knowledge base reasoning"
    - "kblrn end to end learning of knowledge base representations with latent relational and numerical features"
    - "billion scale similarity search with gpus"
    - "end to end differentiable proving"

Connected through hyperedge HE-6 (induced by source paper "program synthesis and semantic parsing with learned code idioms"):
  with members:
    - "encoding database schemas with relation aware self attention for text to sql parsers"
    - "learning programmatic idioms for scalable semantic parsing"
    - "a grammar based structural cnn decoder for code generation"
    - "self attention with relative position representations"
    - "generative code modeling with graphs"
    - "structvae tree structured latent variable models for semi supervised semantic parsing"
    - "coarse to fine decoding for neural semantic parsing"
    - "spider a large scale human labeled dataset for complex and cross domain semantic parsing and text to sql task"

Connected through hyperedge HE-7 (induced by source paper "learning to infer and execute 3d shape programs"):
  with members:
    - "pixel2mesh generating 3d mesh models from single rgb images"
    - "scores shape composition with recursive substructure priors"
    - "physical primitive decomposition"
    - "learning to adapt meta learning for model based control"
    - "pix3d dataset and methods for single image 3d shape modeling"
    - "3d prnn generating shape primitives with recurrent neural networks"
    - "robustfill neural program learning under noisy i o"
    - "inferring and executing programs for visual reasoning"

Connected through hyperedge HE-8 (induced by source paper "synthesizing action sequences for modifying model decisions"):
  with members:
    - "houdini lifelong learning as program synthesis"
    - "interpreting neural network judgments via minimal stable and symbolic corrections"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "axiomatic attribution for deep networks"
    - "counterfactual explanations without opening the black box automated decisions and the gdpr"
    - "scalable planning with tensorflow for hybrid nonlinear domains"
    - "a unified approach to interpreting model predictions"
    - "practical black box attacks against machine learning"

Question: Please tell me which class the center node 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)