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 "towards verified stochastic variational inference for probabilistic programs"):
  Abstract: Probabilistic programming is the idea of writing models from statistics and machine learning using program notations and reasoning about these models using generic inference engines. Recently its combination with deep learning has been explored intensely, which led to the development of deep probabilistic programming languages. At the core of this development lie inference engines based on stochastic variational inference algorithms. When asked to find information about the posterior distribution of a model written in such a language, these algorithms convert this posterior-inference query into an optimisation problem and solve it approximately by a form of gradient ascent or descent. In this paper, we analyse one of the most fundamental and versatile variational inference algorithms, called score estimator or REINFORCE, using tools from denotational semantics and program analysis. We formally express what this algorithm does on models denoted by programs, and expose implicit assumptions made by the algorithm on the models. The violation of these assumptions may lead to an undefined optimisation objective or the loss of convergence guarantee of the optimisation process. We then describe rules for proving these assumptions, which can be automated by static program analyses. Some of our rules use nontrivial facts from continuous mathematics, and let us replace requirements about integrals in the assumptions, by conditions involving differentiation or boundedness, which are much easier to prove automatically. Following our general methodology, we have developed a static program analysis for the Pyro programming language that aims at discharging the assumption about what we call model-guide support match. Applied to the eight representative model-guide pairs from the Pyro webpage, our analysis finds a bug in two of these cases and shows that the assumptions are met in the others.

Includes members:
  Member "pyro deep universal probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the next decade in ai four steps towards robust artificial intelligence")
  Member "discrete continuous mixtures in probabilistic programming generalized semantics and inference algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generative datalog with continuous distributions")
  Member "a domain theory for statistical probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the linear structure of cones")
  Member "existence and continuity of differential entropy for a class of distributions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how compressible are innovation processes")
  Member "a convenient category for higher order probability theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization")
  Member "denotational validation of higher order bayesian inference":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "correctness of sequential monte carlo inference for probabilistic programming languages")
  Member "cantor meets scott semantic foundations for probabilistic networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "deriving probability density functions from probabilistic functional programs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "operational semantics and program verification using many sorted hybrid modal logic")

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)