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: "step indexed logical relations for probability"
  Abstract: It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicative polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and, moreover, that it is convenient for reasoning about concrete program equivalences. Finally, we extend the language with dynamically allocated first-order references and show how to extend the logical relation to this language. We show that the resulting relation remains useful for reasoning about examples involving both state and probabilistic choice.

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"
    - "abstract effects and proof relevant logical relations"
    - "church scott ptime an application of resource sensitive realizability"
    - "logical relations for monadic types"

Connected through hyperedge HE-2 (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"
    - "relational reasoning via probabilistic coupling"
    - "a lambda calculus foundation for universal probabilistic programming"

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

Connected through hyperedge HE-4 (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"
    - "a program logic for union bounds"
    - "weakest precondition reasoning for expected run times of probabilistic programs"
    - "synthesizing probabilistic invariants via doob s decomposition"
    - "reasoning about recursive probabilistic programs"
    - "on probabilistic applicative bisimulation and call by value λ calculi long version"

Connected through hyperedge HE-5 (induced by source paper "contextual equivalence for a probabilistic language with continuous random variables and recursion"):
  with members:
    - "semantics for probabilistic programming higher order functions continuous distributions and soft constraints"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "a compilation target for probabilistic programming languages"
    - "venture a higher order probabilistic programming platform with programmable inference"
    - "church a language for generative models"

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"
    - "relational reasoning via probabilistic coupling"
    - "higher order approximate relational refinement types for mechanism design and differential privacy"
    - "proving differential privacy in hoare logic"

Connected through hyperedge HE-7 (induced by source paper "effectful applicative bisimilarity monads relators and howe s method long version"):
  with members:
    - "logical relations for monadic types"

Connected through hyperedge HE-8 (induced by source paper "metric reasoning about λ terms the general case long version"):
  with members:
    - "church a language for generative models"

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)