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 "decidable synthesis of programs with uninterpreted functions"):
  Abstract: We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. The programs in our class use uninterpreted functions and relations, and abide by a restriction called coherence that was recently identified to yield decidable verification. We formulate a powerful grammar-restricted (syntax-guided) synthesis problem for coherent uninterpreted programs and show the problem to be decidable. We identify its precise complexity, which is doubly exponential in the set of program variables and linear in the size of the grammar. The decision procedure uses tree automata which accept finite syntax trees of all correct programs. It checks that each of the infinitely many executions for a given program is correct using a finite memory streaming congruence closure algorithm. We also study variants of uninterpreted program synthesis: synthesis of transition systems with lower complexity (EXPTIME), synthesis of recursive programs, and synthesis of Boolean programs. We also show undecidability results that argue the necessity of our restrictions.

Includes members:
  Member "proving unrealizability for syntax guided synthesis":
    also connected through other hyperedges:
      (none)
  Member "a decidable fragment of second order logic with applications to synthesis":
    also connected through other hyperedges:
      (none)
  Member "bounded synthesis of register transducers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on computability of data word functions defined by transducers")
  Member "decidable verification of uninterpreted programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deciding memory safety for single pass heap manipulating programs")
  Member "program synthesis using abstraction refinement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "resource guided program synthesis")
  Member "abstract learning frameworks for synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complexity and information in invariant inference")
  Member "a theory of formal synthesis via inductive learning":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "analyzing cyber physical systems from the perspective of artificial intelligence")
  Member "what s decidable about syntax guided synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proving unrealizability for syntax guided synthesis")

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)