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 "an assertion based program logic for probabilistic programs"):
  Abstract: Research on deductive verification of probabilistic programs has considered expectation-based logics, where pre- and post-conditions are real-valued functions on states, and assertion-based logics, where pre- and post-conditions are boolean predicates on state distributions. Both approaches have developed over nearly four decades, but they have different standings today. Expectation-based systems have managed to formalize many sophisticated case studies, while assertion-based systems today have more limited expressivity and have targeted simpler examples. #R##N#We present Ellora, a sound and relatively complete assertion-based program logic, and demonstrate its expressivity by verifying several classical examples of randomized algorithms using an implementation in the EasyCrypt proof assistant. Ellora features new proof rules for loops and adversarial code, and supports richer assertions than existing program logics. We also show that Ellora allows convenient reasoning about complex probabilistic concepts by developing a new program logic for probabilistic independence and distribution law, and then smoothly embedding it into Ellora. Our work demonstrates that the assertion-based approach is not fundamentally limited and suggests that some notions are potentially easier to reason about in assertion-based systems.

Includes members:
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "inferring covariances for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tail probabilities for randomized program runtimes via martingales for higher moments")
  Member "a new rule for almost certain termination of probabilistic and demonic programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "new approaches for almost sure termination of probabilistic programs")
  Member "a program logic for union bounds":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "unifying graded and parameterised monads")
  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 "step indexed logical relations for probability":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem")

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)