human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "learning abstractions for program synthesis"):
  Abstract: Many example-guided program synthesis techniques use abstractions to prune the search space. While abstraction-based synthesis has proven to be very powerful, a domain expert needs to provide a suitable abstract domain, together with the abstract transformers of each DSL construct. However, coming up with useful abstractions can be non-trivial, as it requires both domain expertise and knowledge about the synthesizer. In this paper, we propose a new technique for learning abstractions that are useful for instantiating a general synthesis framework in a new domain. Given a DSL and a small set of training problems, our method uses tree interpolation to infer reusable predicate templates that speed up synthesis in a given domain. Our method also learns suitable abstract transformers by solving a certain kind of second-order constraint solving problem in a data-driven way. We have implemented the proposed method in a tool called ATLAS and evaluate it in the context of the BLAZE meta-synthesizer. Our evaluation shows that (a) ATLAS can learn useful abstract domains and transformers from few training problems, and (b) the abstractions learned by ATLAS allow BLAZE to achieve significantly better results compared to manually-crafted abstractions.

Includes members:
  Member "program synthesis using abstraction refinement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "resource guided program synthesis")
  Member "synthesizing imperative programs from examples guided by static analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "verification and synthesis of symmetric uni rings for leads to properties")
  Member "automated migration of hierarchical data to relational tables using programming by example":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "data migration using datalog program synthesis")
  Member "synthesis of data completion scripts using finite tree automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi modal synthesis of regular expressions")
  Member "component based synthesis of table consolidation and transformation tasks from examples":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "counterexample guided neural synthesis")
  Member "program synthesis from polymorphic refinement types":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "learning to represent programs with property signatures")
  Member "sat based methods for circuit synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the first reactive synthesis competition syntcomp 2014")
  Member "interpolant based transition relation approximation":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity and information in invariant inference")

Question: Please tell me which class the source paper 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)