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 "quantitative separation logic a logic for reasoning about probabilistic pointer programs"):
  Abstract: We present quantitative separation logic (QSL). In contrast to classical separation logic, QSL employs quantities which evaluate to real numbers instead of predicates which evaluate to Boolean values. The connectives of classical separation logic, separating conjunction and separating implication, are lifted from predicates to quantities. This extension is conservative: Both connectives are backward compatible to their classical analogs and obey the same laws, e.g. modus ponens, adjointness, etc. #R##N##R##N#Furthermore, we develop a weakest precondition calculus for quantitative reasoning about probabilistic pointer programs in QSL. This calculus is a conservative extension of both Ishtiaq’s, O’Hearn’s and Reynolds’ separation logic for heap-manipulating programs and Kozen’s / McIver and Morgan’s weakest preexpectations for probabilistic programs. Soundness is proven with respect to an operational semantics based on Markov decision processes. Our calculus preserves O’Hearn’s frame rule, which enables local reasoning. We demonstrate that our calculus enables reasoning about quantities such as the probability of terminating with an empty heap, the probability of reaching a certain array permutation, or the expected length of a list.

Includes members:
  Member "an assertion based program logic for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a probabilistic separation logic")
  Member "quantitative separation logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a separation logic for concurrent randomized programs")
  Member "a separation logic for concurrent randomized programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a probabilistic separation logic")
  Member "bounded expectations resource analysis for probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exponential automatic amortized resource analysis")
  Member "a new proof rule for almost sure termination":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cost analysis of nondeterministic probabilistic programs")
  Member "weakest precondition reasoning for expected run times of probabilistic programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "exponential automatic amortized resource analysis")
  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 "amortised resource analysis with separation logic":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "exponential automatic amortized resource 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.LO(Logic in Computer Science)