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 "compositional inference metaprogramming with convergence guarantees"):
  Abstract: Inference metaprogramming enables effective probabilistic programming by supporting the decomposition of executions of probabilistic programs into subproblems and the deployment of hybrid probabilistic inference algorithms that apply different probabilistic inference algorithms to different subproblems. We introduce the concept of independent subproblem inference (as opposed to entangled subproblem inference in which the subproblem inference algorithm operates over the full program trace) and present a mathematical framework for studying convergence properties of hybrid inference algorithms that apply different Markov-Chain Monte Carlo algorithms to different parts of the inference problem. We then use this formalism to prove asymptotic convergence results for probablistic programs with inference metaprogramming. To the best of our knowledge this is the first asymptotic convergence result for hybrid probabilistic inference algorithms defined by (subproblem-based) inference metaprogramming.

Includes members:
  Member "a convenient category for higher order probability theory":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards verified stochastic variational inference for probabilistic programs")
  Member "denotational validation of higher order bayesian inference":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "correctness of sequential monte carlo inference for probabilistic programming languages")
  Member "swift compiled inference for probabilistic programming languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generative grading neural approximate parsing for automated student feedback")
  Member "a lambda calculus foundation for universal probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  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")
  Member "gibbs sampling in open universe stochastic languages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "swift compiled inference for probabilistic programming languages")
  Member "probabilistic operational semantics for the lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "decomposing probabilistic lambda calculi")

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)