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: "probabilistic operational semantics for the lambda calculus"
  Abstract: Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both inductively and coinductively defined. Moreover, small-step and big-step semantics are shown to produce identical outcomes, both in call-by- value and in call-by-name. Plotkin's CPS translation is extended to accommodate the choice operator and shown correct with respect to the operational semantics. Finally, the expressive power of the obtained system is studied: the calculus is shown to be sound and complete with respect to computable probability distributions.

Connected through hyperedge HE-1 (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"
    - "full abstraction for probabilistic pcf"

Connected through hyperedge HE-2 (induced by source paper "a diagrammatic calculus for algebraic effects"):
  with members:
    - "behavioural equivalence via modalities for algebraic effects"

Connected through hyperedge HE-3 (induced by source paper "probabilistic programming with densities in slicstan efficient flexible and deterministic"):
  with members:
    - "a convenient category for higher order probability theory"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "tensorflow a system for large scale machine learning"
    - "bayesdb a probabilistic programming system for querying the probable implications of data"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "running probabilistic programs backwards"
    - "venture a higher order probabilistic programming platform with programmable inference"
    - "measure transformer semantics for bayesian machine learning"

Connected through hyperedge HE-4 (induced by source paper "lambda calculus and probabilistic computation"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "toward general analysis of recursive probability models"
    - "church a language for generative models"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-5 (induced by source paper "compositional inference metaprogramming with convergence guarantees"):
  with members:
    - "a convenient category for higher order probability theory"
    - "denotational validation of higher order bayesian inference"
    - "swift compiled inference for probabilistic programming languages"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "venture a higher order probabilistic programming platform with programmable inference"
    - "church a language for generative models"
    - "gibbs sampling in open universe stochastic languages"

Connected through hyperedge HE-6 (induced by source paper "quantum programming made easy"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "qpcf higher order languages and quantum circuits"
    - "wave style token machines and quantum lambda calculi"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-7 (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"
    - "full abstraction for probabilistic pcf"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-8 (induced by source paper "on the termination problem for probabilistic higher order recursive programs"):
  with members:
    - "branching processes for quickcheck generators"
    - "on probabilistic term rewriting"
    - "a convenient category for higher order probability theory"
    - "a new proof rule for almost sure termination"
    - "relational semantics of linear logic and higher order model checking"
    - "on the hardness of almost sure termination"
    - "complexity of model checking recursion schemes for fragments of the modal mu calculus"
    - "church a language for generative models"

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)