human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "termination of nondeterministic recursive probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "a new rule for almost certain termination of probabilistic and demonic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new approaches for almost sure termination of probabilistic programs")
  Member "termination analysis of probabilistic programs through positivstellensatz s":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "proving differential privacy via probabilistic couplings":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "guidelines for implementing and auditing differentially private systems")
  Member "weakest precondition reasoning for expected run times of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponential automatic amortized resource analysis")
  Member "synthesizing probabilistic invariants via doob s decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")
  Member "reasoning about recursive probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "t2 temporal property verification":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "control flow refinement by partial evaluation and its application to termination and cost analysis")

Question: Please tell me which class the source paper 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)