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 "synthetic topology in homotopy type theory for probabilistic programming"):
  Abstract: The ALEA Coq library formalizes measure theory based on a variant of the Giry monad on the category of sets. This enables the interpretation of a probabilistic programming language with primitives for sampling from discrete distributions. However, continuous distributions have to be discretized because the corresponding measures cannot be defined on all subsets of their carriers. #R##N#This paper proposes the use of synthetic topology to model continuous distributions for probabilistic computations in type theory. We study the initial $\sigma$-frame and the corresponding induced topology on arbitrary sets. Based on these intrinsic topologies we define valuations and lower integrals on sets, and prove versions of the Riesz and Fubini theorems. We then show how the Lebesgue valuation, and hence continuous distributions, can be constructed.

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 "a domain theory for statistical probabilistic programming")
  Member "formalising real numbers in homotopy type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the hott library a formalization of homotopy type theory in coq")
  Member "stack semantics of type theory":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cellular cohomology in homotopy type theory")
  Member "a convenient category for higher order probability theory":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "etalumis bringing probabilistic programming to scientific simulators at scale")
  Member "the hott library a formalization of homotopy type theory in coq":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a hott quantum equational theory extended version")
  Member "partiality revisited the partiality monad as a quotient inductive inductive type":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "constructing higher inductive types as groupoid quotients")
  Member "quotient inductive inductive types":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "shallow embedding of type theory is morally correct")

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)