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: "lambda calculus and probabilistic computation"
  Abstract: We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that both enjoys confluence and standardization, in an extended way: we revisit these two fundamental notions to take into account the asymptotic behaviour of terms. #R##N#The common root of the two calculi is a further calculus based on Linear Logic, $\Lambda_\oplus^!$, which allows for a fine control of the interaction between choice and copying, and which allows us to develop a unified, modular approach.

Connected through hyperedge HE-1 (induced by source paper "decomposing probabilistic lambda calculi"):
  with members:
    - "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"
    - "probabilistic operational semantics for the lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "probabilistic rewriting on normalization termination and unique normal forms"):
  with members:
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

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)