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 using abstraction refinement"
  Abstract: We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement. Our method uses the abstract semantics of the underlying DSL to find a program $P$ whose abstract behavior satisfies the examples. However, since program $P$ may be spurious with respect to the concrete semantics, our approach iteratively refines the abstraction until we either find a program that satisfies the examples or prove that no such DSL program exists. Because many programs have the same input-output behavior in terms of their abstract semantics, this synthesis methodology significantly reduces the search space compared to existing techniques that use purely concrete semantics. While synthesis using abstraction refinement (SYNGAR) could be implemented in different settings, we propose a refinement-based synthesis algorithm that uses abstract finite tree automata (AFTA). Our technique uses a coarse initial program abstraction to construct an initial AFTA, which is iteratively refined by constructing a proof of incorrectness of any spurious program. In addition to ruling out the spurious program accepted by the previous AFTA, proofs of incorrectness are also useful for ruling out many other spurious programs. We implement these ideas in a framework called \tool. We have used the BLAZE framework to build synthesizers for string and matrix transformations, and we compare BLAZE with existing techniques. Our results for the string domain show that BLAZE compares favorably with FlashFill, a domain-specific synthesizer that is now deployed in Microsoft PowerShell. In the context of matrix manipulations, we compare BLAZE against Prose, a state-of-the-art general-purpose VSA-based synthesizer, and show that BLAZE results in a 90x speed-up over Prose.

Connected through hyperedge HE-1 (induced by source paper "resource guided program synthesis"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "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"
    - "program synthesis from polymorphic refinement types"
    - "denotational cost semantics for functional languages with inductive types"
    - "from non preemptive to preemptive scheduling using synchronization synthesis"

Connected through hyperedge HE-2 (induced by source paper "decidable synthesis of programs with uninterpreted functions"):
  with members:
    - "proving unrealizability for syntax guided synthesis"
    - "a decidable fragment of second order logic with applications to synthesis"
    - "bounded synthesis of register transducers"
    - "decidable verification of uninterpreted programs"
    - "abstract learning frameworks for synthesis"
    - "a theory of formal synthesis via inductive learning"
    - "what s decidable about syntax guided synthesis"
    - "distributed synthesis for acyclic architectures"

Connected through hyperedge HE-3 (induced by source paper "multi modal synthesis of regular expressions"):
  with members:
    - "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"
    - "program synthesis using conflict driven learning"
    - "synthesis of data completion scripts using finite tree automata"
    - "learning a natural language interface with neural programmer"
    - "neural generation of regular expressions from natural language with minimal domain knowledge"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "learning semantic string transformations from examples"

Connected through hyperedge HE-4 (induced by source paper "synthesizing database programs for schema refactoring"):
  with members:
    - "relational program synthesis"
    - "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"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-5 (induced by source paper "visualization by example"):
  with members:
    - "synthesizing bijective lenses"
    - "program synthesis using conflict driven learning"
    - "synthesis of data completion scripts using finite tree automata"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"

Connected through hyperedge HE-6 (induced by source paper "program synthesis by type guided abstraction refinement"):
  with members:
    - "frangel component based synthesis with control structures"
    - "program synthesis from polymorphic refinement types"
    - "incremental inductive coverability"

Connected through hyperedge HE-7 (induced by source paper "learning abstractions for program synthesis"):
  with members:
    - "synthesizing imperative programs from examples guided by static analysis"
    - "automated migration of hierarchical data to relational tables using programming by example"
    - "synthesis of data completion scripts using finite tree automata"
    - "component based synthesis of table consolidation and transformation tasks from examples"
    - "program synthesis from polymorphic refinement types"
    - "sat based methods for circuit synthesis"
    - "interpolant based transition relation approximation"

Connected through hyperedge HE-8 (induced by source paper "relational program synthesis"):
  with members:
    - "synthesizing imperative programs from examples guided by static analysis"
    - "automated migration of hierarchical data to relational tables using programming by example"
    - "verifying equivalence of database driven applications"
    - "synthesis of data completion scripts using finite tree automata"
    - "program synthesis from polymorphic refinement types"

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)