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: "proof relevant logical relations for name generation"
  Abstract: Pitts and Stark's $\nu$-calculus is a paradigmatic total language for#N#studying the problem of contextual equivalence in higher-order languages with#N#name generation. Models for the $\nu$-calculus that validate basic equivalences#N#concerning names may be constructed using functor categories or nominal sets,#N#with a dynamic allocation monad used to model computations that may allocate#N#fresh names. If recursion is added to the language and one attempts to adapt#N#the models from (nominal) sets to (nominal) domains, however, the direct-style#N#construction of the allocation monad no longer works. This issue has previously#N#been addressed by using a monad that combines dynamic allocation with#N#continuations, at some cost to abstraction.#N#  This paper presents a direct-style model of a $\nu$-calculus-like language#N#with recursion using the novel framework of proof-relevant logical relations,#N#in which logical relations also contain objects (or proofs) demonstrating the#N#equivalence of (the semantic counterparts of) programs. Apart from providing a#N#fresh solution to an old problem, this work provides an accessible setting in#N#which to introduce the use of proof-relevant logical relations, free of the#N#additional complexities associated with their use for more sophisticated#N#languages.

Connected through hyperedge HE-1 (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"
    - "relational cost analysis for functional imperative programs"
    - "coupling proofs are probabilistic product programs"
    - "a relational logic for higher order programs"
    - "relational reasoning via probabilistic coupling"
    - "abstract effects and proof relevant logical relations"

Connected through hyperedge HE-2 (induced by source paper "a monadic framework for relational verification applied to information security program equivalence and optimizations"):
  with members:
    - "hypercollecting semantics and its application to static analysis of information flow"
    - "lightdp towards automating differential privacy proofs"
    - "language integrated provenance"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "the foundational cryptography framework"
    - "abstract effects and proof relevant logical relations"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "logical step indexed logical relations"

Connected through hyperedge HE-3 (induced by source paper "coupling proofs are probabilistic product programs"):
  with members:
    - "a program logic for union bounds"
    - "approximate relational hoare logic for continuous random samplings"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "abstract effects and proof relevant logical relations"):
  with members:
    - "nested hoare triples and frame rules for higher order store"
    - "logical step indexed logical relations"

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)