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: "program synthesis from polymorphic refinement types"
  Abstract: We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification---and hence synthesis---of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component combinations and leading to a combinatorial reduction in the size of the search space. At the core of our synthesis procedure is a new algorithm for refinement type checking, which supports specification decomposition. #R##N#We have evaluated our prototype implementation on a large set of synthesis problems and found that it exceeds the state of the art in terms of both scalability and usability. The tool was able to synthesize more complex programs than those reported in prior work (several sorting algorithms and operations on balanced search trees), as well as most of the benchmarks tackled by existing synthesizers, often starting from a more concise and intuitive user input.

Connected through hyperedge HE-1 (induced by source paper "learning to represent programs with property signatures"):
  with members:
    - "learning to infer program sketches"
    - "synthetic datasets for neural program synthesis"
    - "write execute assess program synthesis with a repl"
    - "code2vec learning distributed representations of code"
    - "the three pillars of machine programming"
    - "neural guided deductive search for real time program synthesis from examples"
    - "automatic program synthesis of long programs with a learned garbage collector"
    - "robustfill neural program learning under noisy i o"

Connected through hyperedge HE-2 (induced by source paper "program sketching with live bidirectional evaluation"):
  with members:
    - "program synthesis by type guided abstraction refinement"
    - "live functional programming with typed holes"
    - "bidirectional evaluation with directmanipulation"
    - "synthesizing symmetric lenses"
    - "programming not only by example"
    - "programmatic and direct manipulation together at last"
    - "type directed synthesis of products"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-3 (induced by source paper "concise read only specifications for better synthesis of programs with pointers extended version"):
  with members:
    - "resource guided program synthesis"
    - "automating deductive verification for weak memory programs"
    - "enforcing information flow policies with type targeted program synthesis"

Connected through hyperedge HE-4 (induced by source paper "resource guided program synthesis"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "towards automatic resource bound analysis for ocaml"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "synthesis of recursive adt transformations from reusable templates"
    - "denotational cost semantics for functional languages with inductive types"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"

Connected through hyperedge HE-5 (induced by source paper "synthesizing queries via interactive sketching"):
  with members:
    - "selecting representative examples for program synthesis"
    - "active learning of points to specifications"
    - "program synthesis using conflict driven learning"
    - "interactive program synthesis"
    - "interactive bayesian hierarchical clustering"
    - "deepcoder learning to write programs"
    - "synthesizing program input grammars"
    - "component based synthesis of table consolidation and transformation tasks from examples"

Connected through hyperedge HE-6 (induced by source paper "type directed program synthesis and constraint generation for library portability"):
  with members:
    - "stepping stones to inductive synthesis of low level looping programs"
    - "clblast a tuned opencl blas library"
    - "souper a synthesizing superoptimizer"
    - "yolo9000 better faster stronger"
    - "xnor net imagenet classification using binary convolutional neural networks"
    - "the scalability efficiency maintainability portability trade off in simulation software engineering examples and a preliminary systematic literature review"
    - "you only look once unified real time object detection"
    - "synthesis of recursive adt transformations from reusable templates"

Connected through hyperedge HE-7 (induced by source paper "synthesizing database programs for schema refactoring"):
  with members:
    - "relational program synthesis"
    - "program synthesis using abstraction refinement"
    - "program synthesis using conflict driven learning"
    - "verifying equivalence of database driven applications"
    - "deepcoder learning to write programs"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "on the automated verification of web applications with embedded sql"
    - "component based synthesis of table consolidation and transformation tasks from examples"

Connected through hyperedge HE-8 (induced by source paper "overfitting in synthesis theory and practice extended version"):
  with members:
    - "sygus comp 2018 results and analysis"
    - "horn ice learning for synthesizing invariantsand contracts"
    - "webrelate integrating web data with spreadsheets using examples"
    - "loopinvgen a loop invariant generator based on precondition inference"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "a theory of formal synthesis via inductive learning"
    - "the octagon abstract domain"

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.PL(Programming Languages)