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: "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs"
  Abstract: Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termination property. The qualitative (aka almost-sure) termination problem given a probabilistic program asks whether the program terminates with probability 1. While ranking functions provide a sound and complete method for non-probabilistic programs, the extension of them to probabilistic programs is achieved via ranking supermartingales (RSMs). While deep theoretical results have been established about RSMs, their application to probabilistic programs with nondeterminism has been limited only to academic examples. For non-probabilistic programs, lexicographic ranking functions provide a compositional and practical approach for termination analysis of real-world programs. In this work we introduce lexicographic RSMs and show that they present a sound method for almost-sure termination of probabilistic programs with nondeterminism. We show that lexicographic RSMs provide a tool for compositional reasoning about almost sure termination, and for probabilistic programs with linear arithmetic they can be synthesized efficiently (in polynomial time). We also show that with additional restrictions even asymptotic bounds on expected termination time can be obtained through lexicographic RSMs. Finally, we present experimental results on abstractions of real-world programs to demonstrate the effectiveness of our approach.

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"
    - "a new proof rule for almost sure termination"
    - "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"
    - "a new proof rule for almost sure termination"
    - "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 new proof rule for almost sure termination"
    - "a semantic account of metric preservation"

Connected through hyperedge HE-4 (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"
    - "a new proof rule for almost sure termination"
    - "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-5 (induced by source paper "new approaches for almost sure termination of probabilistic programs"):
  with members:
    - "bounded expectations resource analysis for probabilistic programs"
    - "termination of nondeterministic recursive probabilistic programs"
    - "a new proof rule for almost sure termination"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "reasoning about recursive probabilistic programs"
    - "on the hardness of almost sure termination"

Connected through hyperedge HE-6 (induced by source paper "tail probabilities for randomized program runtimes via martingales for higher moments"):
  with members:
    - "probabilistic tools for the analysis of randomized optimization heuristics"
    - "ranking and repulsing supermartingales for reachability in probabilistic programs"
    - "temporal logic verification of stochastic systems using barrier certificates"
    - "how long o bayesian network will i sample thee a program analysis perspective on expected sampling times"
    - "termination of nondeterministic recursive probabilistic programs"
    - "categorical liveness checking by corecursive algebras"
    - "design and implementation of probabilistic programming language anglican"
    - "inferring covariances for probabilistic programs"

Connected through hyperedge HE-7 (induced by source paper "probabilistic rewriting on normalization termination and unique normal forms"):
  with members:
    - "lambda calculus and probabilistic computation"
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "a new proof rule for almost sure termination"
    - "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"

Connected through hyperedge HE-8 (induced by source paper "almost sure productivity"):
  with members:
    - "a new proof rule for almost sure termination"
    - "on the hardness of almost sure termination"
    - "coalgebraic trace semantics for continuous probabilistic transition systems"
    - "proving termination of probabilistic programs using patterns"
    - "data oblivious stream productivity"

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)