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: "approximate relational hoare logic for continuous random samplings"
  Abstract: Abstract   Approximate relational Hoare logic (apRHL) is a logic for formal verification of the differential privacy of databases written in the programming language pWHILE. Strictly speaking, however, this logic deals only with discrete random samplings. In this paper, we define the graded relational lifting of the subprobabilistic variant of Giry monad, which described differential privacy. We extend the logic apRHL with this graded lifting to deal with continuous random samplings. We give a generic method to give proof rules of apRHL for continuous random samplings.

Connected through hyperedge HE-1 (induced by source paper "duet an expressive higher order language and linear type system for statically enforcing differential privacy"):
  with members:
    - "fuzzi a three level logic for differential privacy"
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "bidirectional type checking for relational properties"
    - "probabilistic relational reasoning via metrics"
    - "subsampled r enyi differential privacy and analytical moments accountant"
    - "renyi differential privacy"
    - "a semantic account of metric preservation"
    - "towards practical differential privacy for sql queries"

Connected through hyperedge HE-2 (induced by source paper "fuzzi a three level logic for differential privacy"):
  with members:
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "ektelo a framework for defining differentially private computations"
    - "detecting violations of differential privacy"
    - "synthesizing coupling proofs of differential privacy"
    - "learning differentially private recurrent language models"
    - "towards practical differential privacy for sql queries"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"

Connected through hyperedge HE-3 (induced by source paper "approximate span liftings compositional semantics for relaxations of differential privacy"):
  with members:
    - "synthesizing coupling proofs of differential privacy"
    - "renyi differential privacy"
    - "liftings for differential privacy"
    - "lightdp towards automating differential privacy proofs"
    - "advanced probabilistic couplings for differential privacy"
    - "concentrated differential privacy simplifications extensions and lower bounds"
    - "differentially private bayesian programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"

Connected through hyperedge HE-4 (induced by source paper "hypothesis testing interpretations and renyi differential privacy"):
  with members:
    - "gaussian differential privacy"
    - "issues encountered deploying differential privacy"
    - "detecting violations of differential privacy"
    - "towards practical differential privacy for sql queries"
    - "concentrated differential privacy simplifications extensions and lower bounds"
    - "rappor randomized aggregatable privacy preserving ordinal response"
    - "differential privacy an economic method for choosing epsilon"
    - "the composition theorem for differential privacy"

Connected through hyperedge HE-5 (induced by source paper "probabilistic relational reasoning via metrics"):
  with members:
    - "duet an expressive higher order language and linear type system for statically enforcing differential privacy"
    - "approximate span liftings compositional semantics for relaxations of differential privacy"
    - "a domain theory for statistical probabilistic programming"
    - "proving expected sensitivity of probabilistic programs"
    - "a semantic account of metric preservation"
    - "differentially private bayesian programming"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "monads need not be endofunctors"

Connected through hyperedge HE-6 (induced by source paper "proving expected sensitivity of probabilistic programs"):
  with members:
    - "a semantic account of metric preservation"
    - "developing bug free machine learning systems with formal mathematics"
    - "reluplex an efficient smt solver for verifying deep neural networks"
    - "liftings for differential privacy"
    - "coupling proofs are probabilistic product programs"
    - "probabilistic couplings for probabilistic reasoning"
    - "computer aided verification for mechanism design"
    - "advanced probabilistic couplings for differential privacy"

Connected through hyperedge HE-7 (induced by source paper "synthesizing coupling proofs of differential privacy"):
  with members:
    - "proving uniformity and independence by self composition and coupling"
    - "a semantic account of metric preservation"
    - "liftings for differential privacy"
    - "coupling proofs are probabilistic product programs"
    - "lightdp towards automating differential privacy proofs"
    - "probabilistic couplings for probabilistic reasoning"
    - "advanced probabilistic couplings for differential privacy"
    - "understanding the sparse vector technique for differential privacy"

Connected through hyperedge HE-8 (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"
    - "proving differential privacy via probabilistic couplings"
    - "relational reasoning via probabilistic coupling"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "step indexed logical relations for probability"
    - "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)