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: "abstract effects and proof relevant logical relations"
  Abstract: We introduce a novel variant of logical relations that maps types not merely to partial equivalence relations on values, as is commonly done, but rather to a proof-relevant generalisation thereof, namely setoids. The objects of a setoid establish that values inhabit semantic types, whilst its morphisms are understood as proofs of semantic equivalence. The transition to proof-relevance solves two well-known problems caused by the use of existential quantification over future worlds in traditional Kripke logical relations: failure of admissibility, and spurious functional dependencies. We illustrate the novel format with two applications: a direct-style validation of Pitts and Stark's equivalences for "new" and a denotational semantics for a region-based effect system that supports type abstraction in the sense that only externally visible effects need to be tracked; non-observable internal modifications, such as the reorganisation of a search tree or lazy initialisation, can count as `pure' or `read only'. This `fictional purity' allows clients of a module soundly to validate more effect-based program equivalences than would be possible with traditional effect systems.

Connected through hyperedge HE-1 (induced by source paper "on the versatility of open logical relations continuity automatic differentiation and a containment theorem"):
  with members:
    - "a simple differentiable programming language"
    - "confusion of tagged perturbations in forward automatic differentiation of higher order functions"
    - "efficient differentiable programming in a functional array processing language"
    - "the simple essence of automatic differentiation"
    - "automatic differentiation in machine learning a survey"
    - "step indexed logical relations for probability"
    - "church scott ptime an application of resource sensitive realizability"
    - "logical relations for monadic types"

Connected through hyperedge HE-2 (induced by source paper "parametric cubical type theory"):
  with members:
    - "a general framework for relational parametricity"
    - "on higher inductive types in cubical type theory"
    - "computational higher type theory iii univalent universes and exact equality"
    - "parametricity automorphisms of the universe and excluded middle"
    - "cubical categories for higher dimensional parametricity"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "a dependent nominal type theory"

Connected through hyperedge HE-3 (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"
    - "relational reasoning via probabilistic coupling"

Connected through hyperedge HE-4 (induced by source paper "behavioural equivalence via modalities for algebraic effects"):
  with members:
    - "quantitative logics for equivalence of effectful programs"
    - "dijkstra monads for all"
    - "dijkstra monads for free"
    - "handling algebraic effects"
    - "a model of cooperative threads"
    - "on csp and the algebraic theory of effects"

Connected through hyperedge HE-5 (induced by source paper "relational cost analysis for functional imperative programs"):
  with members:
    - "verifying and synthesizing constant resource implementations with types"
    - "bidirectional type checking for relational properties"
    - "automating induction for solving horn clauses"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "effect dependent transformations for concurrent programs"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "linear dependent types and relative completeness"
    - "amortised resource analysis with separation logic"

Connected through hyperedge HE-6 (induced by source paper "a monadic framework for relational verification applied to information security program equivalence and optimizations"):
  with members:
    - "proof relevant logical relations for name generation"
    - "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"
    - "quantitative information flow as safety and liveness hyperproperties"
    - "logical step indexed logical relations"

Connected through hyperedge HE-7 (induced by source paper "a monad for full ground reference cells"):
  with members:
    - "linear usage of state"

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.PL(Programming Languages)