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: "a program logic for union bounds"
  Abstract: We propose a probabilistic Hoare logic aHL based on the union bound, a tool from basic probability theory. While the union bound is simple, it is an extremely common tool for analyzing randomized algorithms. In formal verification terms, the union bound allows flexible and compositional reasoning over possible ways an algorithm may go wrong. It also enables a clean separation between reasoning about probabilities and reasoning about events, which are expressed as standard first-order formulas in our logic. Notably, assertions in our logic are non-probabilistic, even though we can conclude probabilistic facts from the judgments. #R##N#Our logic can also prove accuracy properties for interactive programs, where the program must produce intermediate outputs as soon as pieces of the input arrive, rather than accessing the entire input at once. This setting also enables adaptivity, where later inputs may depend on earlier intermediate outputs. We show how to prove accuracy for several examples from the differential privacy literature, both interactive and non-interactive.

Connected through hyperedge HE-1 (induced by source paper "unifying graded and parameterised monads"):
  with members:
    - "the semantic marriage of monads and effects"
    - "session type inference in haskell"

Connected through hyperedge HE-2 (induced by source paper "a programming framework for differential privacy with accuracy concentration bounds"):
  with members:
    - "fuzzi a three level logic for differential privacy"
    - "proving differential privacy with shadow execution"
    - "ektelo a framework for defining differentially private computations"
    - "synthesizing coupling proofs of differential privacy"
    - "apex accuracy aware differentially private data exploration"
    - "renyi differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "advanced probabilistic couplings for differential privacy"

Connected through hyperedge HE-3 (induced by source paper "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"):
  with members:
    - "equivalence between wasserstein and value aware model based reinforcement learning"
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "a convenient category for higher order probability theory"
    - "denotational validation of higher order bayesian inference"
    - "a theory of slicing for probabilistic control flow graphs"
    - "a relational logic for higher order programs"

Connected through hyperedge HE-4 (induced by source paper "automated methods for checking differential privacy"):
  with members:
    - "bisimilarity distances for approximate differential privacy"
    - "detecting violations of differential privacy"
    - "synthesizing coupling proofs of differential privacy"
    - "advanced probabilistic couplings for differential privacy"
    - "understanding the sparse vector technique for differential privacy"
    - "proving differential privacy via probabilistic couplings"
    - "calibrating data to sensitivity in private data analysis"
    - "iterative constructions and private data release"

Connected through hyperedge HE-5 (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"
    - "an assertion based program logic for probabilistic programs"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "trace abstraction modulo probability"):
  with members:
    - "an assertion based program logic for probabilistic programs"
    - "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"
    - "termination analysis of probabilistic programs through positivstellensatz s"

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

Connected through hyperedge HE-8 (induced by source paper "an assertion based program logic for probabilistic programs"):
  with members:
    - "a new proof rule for almost sure termination"
    - "inferring covariances for probabilistic programs"
    - "a new rule for almost certain termination of probabilistic and demonic programs"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "reasoning about recursive probabilistic programs"
    - "step indexed logical relations for probability"
    - "on probabilistic applicative bisimulation and call by value λ calculi long version"

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)