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: "robustfill neural program learning under noisy i o"
  Abstract: The problem of automatically generating a computer program from some specification has been studied since the early days of AI. Recently, two competing approaches for automatic program learning have received significant attention: (1) neural program synthesis, where a neural network is conditioned on input/output (I/O) examples and learns to generate a program, and (2) neural program induction, where a neural network generates new outputs directly using a latent program representation. #R##N#Here, for the first time, we directly compare both approaches on a large-scale, real-world learning task. We additionally contrast to rule-based program synthesis, which uses hand-crafted semantics to guide the program generation. Our neural models use a modified attention RNN to allow encoding of variable-sized sets of I/O pairs. Our best synthesis model achieves 92% accuracy on a real-world test set, compared to the 34% accuracy of the previous best neural synthesis approach. The synthesis model also outperforms a comparable induction model on this task, but we more importantly demonstrate that the strength of each approach is highly dependent on the evaluation metric and end-user application. Finally, we show that we can train our neural models to remain very robust to the type of noise expected in real-world data (e.g., typos), while a highly-engineered rule-based system fails entirely.

Connected through hyperedge HE-1 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning"):
  with members:
    - "learning representations for neural network based classification using the information bottleneck principle"
    - "dynamics aware unsupervised discovery of skills"
    - "causal confusion in imitation learning"
    - "unsupervised discovery of temporal structure in noisy data with dynamical components analysis"
    - "learnability for the information bottleneck"
    - "pareto optimal data compression for binary classification tasks"
    - "relational neural expectation maximization unsupervised discovery of objects and their interactions"
    - "the conditional entropy bottleneck"

Connected through hyperedge HE-2 (induced by source paper "automl zero evolving machine learning algorithms from scratch"):
  with members:
    - "random search and reproducibility for neural architecture search"
    - "nas evaluation is frustratingly hard"
    - "towards modular and programmable architecture search"
    - "weight agnostic neural networks"
    - "exploring randomly wired neural networks for image recognition"
    - "the evolved transformer"
    - "randaugment practical automated data augmentation with a reduced search space"
    - "auto deeplab hierarchical neural architecture search for semantic image segmentation"

Connected through hyperedge HE-3 (induced by source paper "structural language models of code"):
  with members:
    - "learning neurosymbolic generative models via program synthesis"
    - "learning to infer program sketches"
    - "learning programmatic idioms for scalable semantic parsing"
    - "write execute assess program synthesis with a repl"
    - "structured neural summarization"
    - "open vocabulary learning on source code with a graph structured cache"
    - "code2vec learning distributed representations of code"
    - "a general path based representation for predicting program properties"

Connected through hyperedge HE-4 (induced by source paper "unsupervised program synthesis for images using tree structured lstm"):
  with members:
    - "learning to paint with model based deep reinforcement learning"
    - "stochastic beams and where to find them the gumbel top k trick for sampling sequences without replacement"
    - "learning to infer and execute 3d shape programs"
    - "write execute assess program synthesis with a repl"
    - "challenging common assumptions in the unsupervised learning of disentangled representations"
    - "3d aware scene manipulation via inverse graphics"
    - "a tree based decoder for neural machine translation"
    - "automatic program synthesis of long programs with a learned garbage collector"

Connected through hyperedge HE-5 (induced by source paper "a benchmark for systematic generalization in grounded language understanding"):
  with members:
    - "learning compositional rules via neural program synthesis"
    - "cnns found to jump around more skillfully than rnns compositional generalization in seq2seq convolutional networks"
    - "emergent systematic generalization in a situated agent"
    - "compositional generalization through meta sequence to sequence learning"
    - "good enough compositional data augmentation"
    - "compositional generalization in a deep seq2seq model by separating syntax and semantics"
    - "modeling question asking using neural program generation"
    - "babyai a platform to study the sample efficiency of grounded language learning"

Connected through hyperedge HE-6 (induced by source paper "searching a database of source codes using contextualized code search"):
  with members:
    - "multi modal attention network learning for semantic source code retrieval"
    - "on learning meaningful code changes via neural machine translation"
    - "when deep learning met code search"
    - "mapping language to code in programmatic context"
    - "tree2tree neural translation model for learning source code changes"
    - "bert pre training of deep bidirectional transformers for language understanding"
    - "top down tree structured decoding with syntactic connections for neural machine translation and parsing"
    - "variational deep semantic hashing for text documents"

Connected through hyperedge HE-7 (induced by source paper "learning compositional rules via neural program synthesis"):
  with members:
    - "learning to infer program sketches"
    - "learning to prove theorems via interacting with proof assistants"
    - "human few shot learning of compositional instructions"
    - "compositional generalization through meta sequence to sequence learning"
    - "write execute assess program synthesis with a repl"
    - "good enough compositional data augmentation"
    - "compositional generalization in a deep seq2seq model by separating syntax and semantics"
    - "automatic program synthesis of long programs with a learned garbage collector"

Connected through hyperedge HE-8 (induced by source paper "grammar filtering for syntax guided synthesis"):
  with members:
    - "learning to infer program sketches"
    - "synthetic datasets for neural program synthesis"
    - "neural guided deductive search for real time program synthesis from examples"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "sygus comp 2017 results and analysis"
    - "learning efficient algorithms with hierarchical attentive memory"
    - "learning neural programs to parse programs"
    - "deepcoder learning to write programs"

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.AI(Artificial Intelligence)