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: "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.

Connected through hyperedge HE-1 (induced by source paper "a probabilistic separation logic"):
  with members:
    - "quantitative separation logic a logic for reasoning about probabilistic pointer programs"
    - "more is less perfectly secure oblivious algorithms in the multi server setting"
    - "a separation logic for concurrent randomized programs"
    - "the beta bernoulli process and algebraic effects"
    - "a domain theory for statistical probabilistic programming"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "proving uniformity and independence by self composition and coupling"
    - "a language for probabilistically oblivious computation"

Connected through hyperedge HE-2 (induced by source paper "quantitative separation logic a logic for reasoning about probabilistic pointer programs"):
  with members:
    - "quantitative separation logic"
    - "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-3 (induced by source paper "trace abstraction modulo probability"):
  with members:
    - "constraint based synthesis of coupling proofs"
    - "efficient interpolation for the theory of arrays"
    - "synthesizing coupling proofs of differential privacy"
    - "a new proof rule for almost sure termination"
    - "towards practical differential privacy for sql queries"
    - "a storm is coming a modern probabilistic model checker"
    - "a program logic for union bounds"
    - "termination analysis of probabilistic programs through positivstellensatz s"

Connected through hyperedge HE-4 (induced by source paper "constraint based synthesis of coupling proofs"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "proving expected sensitivity of probabilistic programs"
    - "proving uniformity and independence by self composition and coupling"
    - "coupling proofs are probabilistic product programs"
    - "probabilistic couplings for probabilistic reasoning"
    - "advanced probabilistic couplings for differential privacy"
    - "termination analysis of probabilistic programs through positivstellensatz s"
    - "proving differential privacy via probabilistic couplings"

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)