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 "a lambda calculus foundation for universal probabilistic programming"):
  Abstract: We develop the operational semantics of an untyped probabilistic lambda-calculus with continuous distributions, as a foundation for universal probabilistic programming languages such as Church, Anglican, and Venture. Our first contribution is to adapt the classic operational semantics of lambda-calculus to a continuous setting via creating a measure space on terms and defining step-indexed approximations. We prove equivalence of big-step and small-step formulations of this distribution-based semantics. To move closer to inference techniques, we also define the sampling-based semantics of a term as a function from a trace of random samples to a value. We show that the distribution induced by integrating over all traces equals the distribution-based semantics. Our second contribution is to formalize the implementation technique of trace Markov chain Monte Carlo (MCMC) for our calculus and to show its correctness. A key step is defining sufficient conditions for the distribution induced by trace MCMC to converge to the distribution-based semantics. To the best of our knowledge, this is the first rigorous correctness proof for trace MCMC for a higher-order functional language.

Includes members:
  Member "deriving probability density functions from probabilistic functional programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards verified stochastic variational inference for probabilistic programs")
  Member "semantics for probabilistic programming higher order functions continuous distributions and soft constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "etalumis bringing probabilistic programming to scientific simulators at scale")
  Member "step indexed logical relations for probability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem")
  Member "running probabilistic programs backwards":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards verified stochastic variational inference for probabilistic programs")
  Member "venture a higher order probabilistic programming platform with programmable inference":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "stochastically differentiable probabilistic programs")
  Member "church a language for generative models":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semiring programming a declarative framework for generalized sum product problems")

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)