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 "modular verification for almost sure termination of probabilistic programs"):
  Abstract: In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [Fioriti and Hermanns 2015]. While the proposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed modular rule is still not sound for almost-sure termination of probabilistic programs. #R##N#Besides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a sound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel notion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales that are linear and show that they can be synthesized in polynomial time. Finally, we present experimental results on a variety of benchmarks and several natural examples that model various types of nested while loops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure termination property.

Includes members:
  Member "cost analysis of nondeterministic probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "quantitative separation logic a logic for reasoning about probabilistic pointer programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "aiming low is harder inductive proof rules for lower bounds on weakest preexpectations in probabilistic program verification")
  Member "new approaches for almost sure termination of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "proving expected sensitivity of probabilistic programs with randomized variable dependent termination time")
  Member "computational approaches for stochastic shortest path on succinct mdps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "bounded expectations resource analysis for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exponential automatic amortized resource analysis")
  Member "termination of nondeterministic recursive probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "tail bound analysis for probabilistic programs via central moments")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "lexicographic ranking supermartingales an efficient approach to termination of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "cost analysis of nondeterministic probabilistic programs")

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.LO(Logic in Computer Science)