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 "measurable cones and stable measurable functions a model for probabilistic higher order programming"):
  Abstract: We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the main primitives of probabilistic functional programming, like continuous and discrete probabilistic distributions, sampling, conditioning and full recursion. We prove the soundness and adequacy of this model with respect to a call-by-name operational semantics and give some examples of its denotations.

Includes members:
  Member "an application of computable distributions to the semantics of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "synthetic topology in homotopy type theory for probabilistic programming")
  Member "mixed powerdomains for probability and nondeterminism":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "a convenient category for higher order probability theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards verified stochastic variational inference for probabilistic programs")
  Member "domains and random variables":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a domain theory for statistical probabilistic programming")
  Member "convexity and order in probabilistic call by name fpc":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "probabilistic call by push value")
  Member "probabilistic call by push value":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the linear structure of cones")
  Member "a lambda calculus foundation for universal probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tail bound analysis for probabilistic programs via central moments")

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.LO(Logic in Computer Science)