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 "on the linear structure of cones"):
  Abstract: For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order computation based on (positive) cones, and a class of totally monotone functions that they called "stable". Then Crubill{\'e} proved that this model is a conservative extension of the earlier probabilistic coherence space model. We continue these investigations by showing that the category of cones and linear and Scott-continuous functions is a model of intuitionistic linear logic. To define the tensor product, we use the special adjoint functor theorem, and we prove that this operation is and extension of the standard tensor product of probabilistic coherence spaces. We also show that these latter are dense in cones, thus allowing to lift the main properties of the tensor product of probabilistic coherence spaces to general cones. Last we define in the same way an exponential of cones and extend measurability to these new operations.

Includes members:
  Member "semantics of higher order probabilistic programs with conditioning":
    also connected through other hyperedges:
      (none)
  Member "differentials and distances in probabilistic coherence spaces":
    also connected through other hyperedges:
      (none)
  Member "linear logic in normed cones probabilistic coherence spaces and beyond":
    also connected through other hyperedges:
      (none)
  Member "a domain theory for statistical probabilistic programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "correctness of sequential monte carlo inference for probabilistic programming languages")
  Member "measurable cones and stable measurable functions a model for probabilistic higher order programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization")
  Member "mixed powerdomains for probability and nondeterminism":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the ideal approach to computing closed subsets in well quasi orderings")
  Member "probabilistic call by push value":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decomposing probabilistic lambda calculi")
  Member "full abstraction for probabilistic pcf":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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.LO(Logic in Computer Science)