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: "towards synthesizing complex programs from input output examples"
  Abstract: In recent years, deep learning techniques have been developed to improve the performance of program synthesis from input-output examples. Albeit its significant progress, the programs that can be synthesized by state-of-the-art approaches are still simple in terms of their complexity. In this work, we move a significant step forward along this direction by proposing a new class of challenging tasks in the domain of program synthesis from input-output examples: learning a context-free parser from pairs of input programs and their parse trees. We show that this class of tasks are much more challenging than previously studied tasks, and the test accuracy of existing approaches is almost 0%. #R##N#We tackle the challenges by developing three novel techniques inspired by three novel observations, which reveal the key ingredients of using deep learning to synthesize a complex program. First, the use of a non-differentiable machine is the key to effectively restrict the search space. Thus our proposed approach learns a neural program operating a domain-specific non-differentiable machine. Second, recursion is the key to achieve generalizability. Thus, we bake-in the notion of recursion in the design of our non-differentiable machine. Third, reinforcement learning is the key to learn how to operate the non-differentiable machine, but it is also hard to train the model effectively with existing reinforcement learning algorithms from a cold boot. We develop a novel two-phase reinforcement learning-based search algorithm to overcome this issue. In our evaluation, we show that using our novel approach, neural parsing programs can be learned to achieve 100% test accuracy on test inputs that are 500x longer than the training samples.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "neurally guided structure inference"):
  with members:
    - "learning to infer and execute 3d shape programs"
    - "automatic program synthesis of long programs with a learned garbage collector"
    - "robust text to sql generation with execution guided decoding"
    - "tree to tree neural networks for program translation"
    - "neural guided constraint logic programming for program synthesis"
    - "robustfill neural program learning under noisy i o"
    - "making neural programming architectures generalize via recursion"
    - "neural sketch learning for conditional program generation"

Connected through hyperedge HE-4 (induced by source paper "learning to infer program sketches"):
  with members:
    - "ain t nobody got time for coding structure aware program synthesis from natural language"
    - "neural guided deductive search for real time program synthesis from examples"
    - "automatic program synthesis of long programs with a learned garbage collector"
    - "neural program search solving programming tasks from description and examples"
    - "coarse to fine decoding for neural semantic parsing"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "neural guided constraint logic programming for program synthesis"
    - "robustfill neural program learning under noisy i o"

Connected through hyperedge HE-5 (induced by source paper "learning fitness functions for genetic algorithms"):
  with members:
    - "mlsys the new frontier of machine learning systems"
    - "fpga based accelerators of deep learning networks for learning and classification a review"
    - "improving the universality and learnability of neural programmer interpreters with combinator abstraction"
    - "the three pillars of machine programming"
    - "automatic program synthesis of long programs with a learned garbage collector"
    - "leveraging grammar and reinforcement learning for neural program synthesis"
    - "making neural programming architectures generalize via recursion"
    - "hierarchical representations for efficient architecture search"

Connected through hyperedge HE-6 (induced by source paper "a neural based program decompiler"):
  with members:
    - "tree to tree neural networks for program translation"
    - "learned in translation contextualized word vectors"
    - "abstract syntax networks for code generation and semantic parsing"
    - "dynamic neural program embedding for program repair"
    - "a syntactic neural model for general purpose code generation"
    - "language to logical form with neural attention"
    - "latent predictor networks for code generation"
    - "learning program embeddings to propagate feedback on student code"

Connected through hyperedge HE-7 (induced by source paper "towards neural guided program synthesis for linear temporal logic specifications"):
  with members:
    - "the 5th reactive synthesis competition syntcomp 2018 benchmarks participants results"
    - "neural guided constraint logic programming for program synthesis"
    - "deepcoder learning to write programs"
    - "neuro symbolic program synthesis"
    - "terpret a probabilistic programming language for program induction"
    - "prioritized experience replay"
    - "neural turing machines"

Connected through hyperedge HE-8 (induced by source paper "tree to tree neural networks for program translation"):
  with members:
    - "robustfill neural program learning under noisy i o"
    - "attention is all you need"
    - "towards neural machine translation with latent tree attention"
    - "towards string to tree neural machine translation"
    - "a survey of machine learning for big code and naturalness"
    - "abstract syntax networks for code generation and semantic parsing"
    - "a syntactic neural model for general purpose code generation"
    - "latent attention for if then program synthesis"

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.LG(Machine Learning)