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: "quantitative separation logic"
  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 both 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 of separating conjunction and implication, etc. #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 Reynolds' weakest preconditions for heap manipulating programs and McIver & Morgan's weakest preexpectations for probabilistic programs. In particular, our calculus preserves O'Hearn's frame rule which enables local reasoning - a key principle of separation logic. We demonstrate that our calculus enables reasoning about quantitaties, such as the probability of terminating with an empty heap or the expected length of a randomly constructed list.

Connected through hyperedge HE-1 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "a separation logic for concurrent randomized programs"
    - "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"
    - "reasoning about recursive probabilistic programs"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-2 (induced by source paper "a separation logic for concurrent randomized programs"):
  with members:
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "a higher order logic for concurrent termination preserving refinement"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "relational reasoning via probabilistic coupling"
    - "step indexed logical relations for probability"

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