human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "full abstraction for probabilistic pcf"
  Abstract: We present a probabilistic version of PCF, a well-known simply typed universal functional language. The type hierarchy is based on a single ground type of natural numbers. Even if the language is globally call-by-name, we allow a call-by-value evaluation for ground type arguments in order to provide the language with a suitable algorithmic expressiveness. We describe a denotational semantics based on probabilistic coherence spaces, a model of classical Linear Logic developed in previous works. We prove an adequacy and an equational full abstraction theorem showing that equality in the model coincides with a natural notion of observational equivalence.

Connected through hyperedge HE-1 (induced by source paper "on the linear structure of cones"):
  with members:
    - "semantics of higher order probabilistic programs with conditioning"
    - "differentials and distances in probabilistic coherence spaces"
    - "linear logic in normed cones probabilistic coherence spaces and beyond"
    - "a domain theory for statistical probabilistic programming"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "probabilistic call by push value"

Connected through hyperedge HE-2 (induced by source paper "decomposing probabilistic lambda calculi"):
  with members:
    - "lambda calculus and probabilistic computation"
    - "a probabilistic and non deterministic call by push value language"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "probabilistic call by push value"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "the geometry of bayesian programming"):
  with members:
    - "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"
    - "a domain theory for statistical probabilistic programming"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "a convenient category for higher order probability theory"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "church a language for generative models"

Connected through hyperedge HE-4 (induced by source paper "differentials and distances in probabilistic coherence spaces"):
  with members:
    - "a domain theory for statistical probabilistic programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-5 (induced by source paper "on the taylor expansion of probabilistic λ terms long version"):
  with members:
    - "revisiting call by value bohm trees in light of their taylor expansion"
    - "a domain theory for statistical probabilistic programming"
    - "a lambda calculus foundation for universal probabilistic programming"

Connected through hyperedge HE-6 (induced by source paper "a linear exponential comonad in s finite transition kernels and probabilistic coherent spaces"):
  with members:
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "geometry of interaction for mall via hughes vanglabbeek proof nets"
    - "measure transformer semantics for bayesian machine learning"

Connected through hyperedge HE-7 (induced by source paper "on the denotational semantics of linear logic with least and greatest fixed points of formulas"):
  with members:
    - "least and greatest fixed points in linear logic"
    - "least and greatest fixpoints in game semantics"

Connected through hyperedge HE-8 (induced by source paper "qpcf higher order languages and quantum circuits"):
  with members:
    - "quantum programming made easy"
    - "formalization of metatheory of the quipper quantum programming language in a linear logic"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "wave style token machines and quantum lambda calculi"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "probabilistic operational semantics for the lambda calculus"

Question: Please tell me which class the center node 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)