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: "reasoning about recursive probabilistic programs"
  Abstract: This paper presents a wp-style calculus for obtaining expectations on the outcomes of (mutually) recursive probabilistic programs. We provide several proof rules to derive one-- and two--sided bounds for such expectations, and show the soundness of our wp-calculus with respect to a probabilistic pushdown automaton semantics. We also give a wp-style calculus for obtaining bounds on the expected runtime of recursive programs that can be used to determine the (possibly infinite) time until termination of such programs.

Connected through hyperedge HE-1 (induced by source paper "tail bound analysis for probabilistic programs via central moments"):
  with members:
    - "cost analysis of nondeterministic probabilistic programs"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "a lambda calculus foundation for universal probabilistic programming"

Connected through hyperedge HE-2 (induced by source paper "cost analysis of nondeterministic probabilistic programs"):
  with members:
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "effective divergence analysis for linear recurrence sequences"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"

Connected through hyperedge HE-3 (induced by source paper "modular verification for almost sure termination of probabilistic programs"):
  with members:
    - "cost analysis of nondeterministic probabilistic programs"
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "new approaches for almost sure termination of probabilistic programs"
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"

Connected through hyperedge HE-4 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"):
  with members:
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "on the termination problem for probabilistic higher order recursive programs"
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "finding polynomial loop invariants for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a weakest pre expectation semantics for mixed sign expectations"
    - "healthiness from duality"

Connected through hyperedge HE-5 (induced by source paper "probabilistic smart contracts secure randomness on the blockchain"):
  with members:
    - "quantitative analysis of smart contracts"
    - "computational approaches for stochastic shortest path on succinct mdps"
    - "when can a distributed ledger replace a trusted third party"
    - "securify practical security analysis of smart contracts"
    - "ergodic mean payoff games for the analysis of attacks in crypto currencies"
    - "cantor meets scott semantic foundations for probabilistic networks"
    - "termination analysis of probabilistic programs through positivstellensatz s"

Connected through hyperedge HE-6 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "quantitative separation logic"
    - "a separation logic for concurrent randomized programs"
    - "bounded expectations resource analysis for probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-7 (induced by source paper "expected runtime of quantum programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "verification of quantum programs"

Connected through hyperedge HE-8 (induced by source paper "runtime analysis of quantum programs a formal approach"):
  with members:
    - "expected runtime of quantum programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"

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)