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: "a type theory for probabilistic and bayesian reasoning"
  Abstract: This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes our probabilistic type theory from quantum type theory, namely the bijective correspondence between predicates and side-effect free actions (called instrument, or assert, maps). The paper shows how suitable computation rules can be derived from this predicate-action correspondence, and uses these rules for calculating conditional probabilities in two well-known examples of Bayesian reasoning in (graphical) models. Our type theory may thus form the basis for a mechanisation of Bayesian inference. 1998 ACM Subject Classification F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic — Lambda calculus and related systems; G.3 [Probability and Statistics]: Probabilistic algorithms; F.3.1 [Logics and Meanings of Programs]: Specifying and Verifying and Reasoning about Programs

Connected through hyperedge HE-1 (induced by source paper "differentially private bayesian programming"):
  with members:
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "approximate relational hoare logic for continuous random samplings"
    - "proving differential privacy via probabilistic couplings"
    - "relational reasoning via probabilistic coupling"
    - "on the differential privacy of bayesian inference"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "proving differential privacy in hoare logic"

Connected through hyperedge HE-2 (induced by source paper "hyper normalisation and conditioning for discrete probability distributions"):
  with members:
    - "abstract hidden markov models a monadic account of quantitative information flow"
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "hidden markov program algebra with iteration"
    - "measure transformer semantics for bayesian machine learning"
    - "compositional closure for bayes risk in probabilistic noninterference"

Connected through hyperedge HE-3 (induced by source paper "an introduction to effectus theory"):
  with members:
    - "quotient comprehension chains"
    - "semantics for a quantum programming language by operator algebras"
    - "orthomodular lattices foulis semigroups and dagger kernel categories"

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)