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 "resource guided program synthesis"):
  Abstract: This article presents resource-guided synthesis, a technique for synthesizing recursive programs that satisfy both a functional specification and a symbolic resource bound. The technique is type-directed and rests upon a novel type system that combines polymorphic refinement types with potential annotations of automatic amortized resource analysis. The type system enables efficient constraint-based type checking and can express precise refinement-based resource bounds. The proof of type soundness shows that synthesized programs are correct by construction. By tightly integrating program exploration and type checking, the synthesizer can leverage the user-provided resource bound to guide the search, eagerly rejecting incomplete programs that consume too many resources. An implementation in the resource-guided synthesizer ReSyn is used to evaluate the technique on a range of recursive data structure manipulations. The experiments show that ReSyn synthesizes programs that are asymptotically more efficient than those generated by a resource-agnostic synthesizer. Moreover, synthesis with ReSyn is faster than a naive combination of synthesis and resource analysis. ReSyn is also able to generate implementations that have a constant resource consumption for fixed input sizes, which can be used to mitigate side-channel attacks.

Includes members:
  Member "verifying and synthesizing constant resource implementations with types":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "exponential automatic amortized resource analysis")
  Member "program synthesis using abstraction refinement":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decidable synthesis of programs with uninterpreted functions")
  Member "program synthesis using conflict driven learning":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "comparison of syntactic and semantic representations of programs in neural embeddings")
  Member "towards automatic resource bound analysis for ocaml":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  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 "synthesis of recursive adt transformations from reusable templates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "type directed program synthesis and constraint generation for library portability")
  Member "program synthesis from polymorphic refinement types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "learning to represent programs with property signatures")
  Member "denotational cost semantics for functional languages with inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "exponential automatic amortized resource analysis")

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)