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: "relational reasoning via probabilistic coupling"
  Abstract: Probabilistic coupling is a powerful tool for analyzing pairs of probabilistic processes. Roughly, coupling two processes requires finding an appropriate witness process that models both processes in the same probability space. Couplings are powerful tools proving properties about the relation between two processes, include reasoning about convergence of distributions and stochastic dominance--a probabilistic version of a monotonicity property.#R##N##R##N#While the mathematical definition of coupling looks rather complex and cumbersome to manipulate, we show that the relational program logic pRHL--the logic underlying the EasyCrypt cryptographic proof assistant--already internalizes a generalization of probabilistic coupling. With this insight, constructing couplings is no harder than constructing logical proofs. We demonstrate how to express and verify classic examples of couplings in pRHL, and we mechanically verify several couplings in EasyCrypt.

Connected through hyperedge HE-1 (induced by source paper "relational proofs for quantum programs"):
  with members:
    - "quantum relational hoare logic with expectations"
    - "quantitative robustness analysis of quantum programs"
    - "proving expected sensitivity of probabilistic programs"
    - "proving uniformity and independence by self composition and coupling"
    - "probabilistic couplings for probabilistic reasoning"
    - "proving differential privacy via probabilistic couplings"
    - "toward automatic verification of quantum cryptographic protocols"
    - "verification of quantum programs"

Connected through hyperedge HE-2 (induced by source paper "the next 700 relational program logics"):
  with members:
    - "synthetic topology in homotopy type theory for probabilistic programming"
    - "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "proof relevant logical relations for name generation"
    - "relational cost analysis for functional imperative programs"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "abstract effects and proof relevant logical relations"

Connected through hyperedge HE-3 (induced by source paper "relational reasoning for markov chains in a probabilistic guarded lambda calculus"):
  with members:
    - "proving uniformity and independence by self composition and coupling"
    - "the guarded lambda calculus programming and reasoning with guarded recursion for coinductive types"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "guarded dependent type theory with coinductive types"
    - "differentially private bayesian programming"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-4 (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"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "step indexed logical relations for probability"

Connected through hyperedge HE-5 (induced by source paper "bisimilarity distances for approximate differential privacy"):
  with members:
    - "on computing the total variation distance of hidden markov models"
    - "synthesizing coupling proofs of differential privacy"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-6 (induced by source paper "coupling proofs are probabilistic product programs"):
  with members:
    - "proof relevant logical relations for name generation"
    - "a program logic for union bounds"
    - "approximate relational hoare logic for continuous random samplings"
    - "proving differential privacy via probabilistic couplings"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "step indexed logical relations for probability"
    - "proving differential privacy in hoare logic"

Connected through hyperedge HE-7 (induced by source paper "advanced probabilistic couplings for differential privacy"):
  with members:
    - "coupling proofs are probabilistic product programs"
    - "lightdp towards automating differential privacy proofs"
    - "understanding the sparse vector technique for differential privacy"
    - "concentrated differential privacy simplifications extensions and lower bounds"
    - "a program logic for union bounds"
    - "make up your mind the price of online queries in differential privacy"
    - "privacy odometers and filters pay as you go composition"
    - "proving differential privacy via probabilistic couplings"

Connected through hyperedge HE-8 (induced by source paper "differentially private bayesian programming"):
  with members:
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "approximate relational hoare logic for continuous random samplings"
    - "proving differential privacy via probabilistic couplings"
    - "on the differential privacy of bayesian inference"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "a type theory for probabilistic and bayesian reasoning"
    - "proving differential privacy in hoare logic"

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)