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 new proof rule for almost sure termination"
  Abstract: An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it is expressed in a program logic, and so applies directly to source code. The programs may contain both probabilistic- and demonic choice, and the probabilistic choices may depend on the current state. #R##N#As do other researchers, we use variant functions (a.k.a. "super-martingales") that are real-valued and probabilistically might decrease on each loop iteration; but our key innovation is that the amount as well as the probability of the decrease are parametric. #R##N#We prove the soundness of the new rule, indicate where its applicability goes beyond existing rules, and explain its connection to classical results on denumerable (non-demonic) Markov chains.

Connected through hyperedge HE-1 (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"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "non polynomial worst case analysis of recursive programs"

Connected through hyperedge HE-2 (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"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "cantor meets scott semantic foundations for probabilistic networks"

Connected through hyperedge HE-3 (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"
    - "finding polynomial loop invariants for probabilistic programs"
    - "a semantic account of metric preservation"
    - "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 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-5 (induced by source paper "computing expected runtimes for constant probability programs"):
  with members:
    - "termination of triangular integer loops is decidable"
    - "automated recurrence analysis for almost linear expected runtime bounds"
    - "bounded expectations resource analysis for probabilistic programs"
    - "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "on the hardness of almost sure termination"
    - "on termination of integer linear loops"
    - "minimizing expected termination time in one counter markov decision processes"

Connected through hyperedge HE-6 (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"
    - "finding polynomial loop invariants for probabilistic programs"
    - "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-7 (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"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-8 (induced by source paper "trace abstraction modulo probability"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "constraint based synthesis of coupling proofs"
    - "efficient interpolation for the theory of arrays"
    - "synthesizing coupling proofs of differential privacy"
    - "towards practical differential privacy for sql queries"
    - "a storm is coming a modern probabilistic model checker"
    - "a program logic for union bounds"
    - "termination analysis of probabilistic programs through positivstellensatz s"

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.PL(Programming Languages)