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: "finding polynomial loop invariants for probabilistic programs"
  Abstract: Quantitative loop invariants are an essential element in the verification of probabilistic programs. Recently, multivariate Lagrange interpolation has been applied to synthesizing polynomial invariants. In this paper, we propose an alternative approach. First, we fix a polynomial template as a candidate of a loop invariant. Using Stengle's Positivstellensatz and a transformation to a sum-of-squares problem, we find sufficient conditions on the coefficients. Then, we solve a semidefinite programming feasibility problem to synthesize the loop invariants. If the semidefinite program is unfeasible, we backtrack after increasing the degree of the template. Our approach is semi-complete in the sense that it will always lead us to a feasible solution if one exists and numerical errors are small. Experimental results show the efficiency of our approach.

Connected through hyperedge HE-1 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time"):
  with members:
    - "kantorovich continuity of probabilistic 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"
    - "proving expected sensitivity of probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a semantic account of metric preservation"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"

Connected through hyperedge HE-2 (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"
    - "a new proof rule for almost sure termination"
    - "a weakest pre expectation semantics for mixed sign expectations"
    - "healthiness from duality"
    - "weakest precondition reasoning for expected run times of probabilistic programs"

Connected through hyperedge HE-3 (induced by source paper "automatic generation of moment based invariants for prob solvable loops"):
  with members:
    - "polynomial invariant generation for non deterministic recursive programs"
    - "tail probabilities for randomized program runtimes via martingales for higher moments"
    - "aligator jl a julia package for loop invariant generation"
    - "a new proof rule for almost sure termination"
    - "a storm is coming a modern probabilistic model checker"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "bounded model checking for probabilistic programs"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"

Connected through hyperedge HE-4 (induced by source paper "polynomial probabilistic invariants and the optional stopping theorem"):
  with members:
    - "polynomial invariant generation for non deterministic recursive programs"
    - "compositional analysis for almost sure termination of probabilistic programs"
    - "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification"
    - "tail probabilities for randomized program runtimes via martingales for higher moments"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "counterexample guided polynomial loop invariant generation by lagrange interpolation"

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)