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: "frangel component based synthesis with control structures"
  Abstract: In component-based program synthesis, the synthesizer generates a program given a library of components (functions). Existing component-based synthesizers have difficulty synthesizing loops and other control structures, and they often require formal specifications of the components, which can be expensive to generate. We present FrAngel, a new approach to component-based synthesis that can synthesize short Java functions with control structures when given a desired signature, a set of input-output examples, and a collection of libraries (without formal specifications). FrAngel aims to discover programs with many distinct behaviors by combining two main ideas. First, it mines code fragments from partially-successful programs that only pass some of the examples. These extracted fragments are often useful for synthesis due to a property that we call special-case similarity. Second, FrAngel uses angelic conditions as placeholders for control structure conditions and optimistically evaluates the resulting program sketches. Angelic conditions decompose the synthesis process: FrAngel first finds promising partial programs and later fills in their missing conditions. We demonstrate that FrAngel can synthesize a variety of interesting programs with combinations of control structures within seconds, significantly outperforming prior state-of-the-art.

Connected through hyperedge HE-1 (induced by source paper "incremental sampling without replacement for sequence models"):
  with members:
    - "the curious case of neural text degeneration"
    - "stochastic beams and where to find them the gumbel top k trick for sampling sequences without replacement"
    - "spoc search based pseudocode to code"
    - "learning to write with cooperative discriminators"
    - "hierarchical neural story generation"
    - "attention is all you need"
    - "neural combinatorial optimization with reinforcement learning"

Connected through hyperedge HE-2 (induced by source paper "spoc search based pseudocode to code"):
  with members:
    - "neural program repair by jointly learning to localize and repair"
    - "seq2sql generating structured queries from natural language using reinforcement learning"
    - "nl2bash a corpus and semantic parser for natural language interface to the linux operating system"
    - "naps natural program synthesis dataset"
    - "mapping language to code in programmatic context"
    - "coarse to fine decoding for neural semantic parsing"
    - "retrieval based neural code generation"
    - "robustfill neural program learning under noisy i o"

Connected through hyperedge HE-3 (induced by source paper "program synthesis by type guided abstraction refinement"):
  with members:
    - "program synthesis using abstraction refinement"
    - "program synthesis from polymorphic refinement types"
    - "incremental inductive coverability"

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)