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: "a dependent nominal type theory"
  Abstract: Nominal abstract syntax is an approach to representing names and binding#N#pioneered by Gabbay and Pitts. So far nominal techniques have mostly been#N#studied using classical logic or model theory, not type theory. Nominal#N#extensions to simple, dependent and ML-like polymorphic languages have been#N#studied, but decidability and normalization results have only been established#N#for simple nominal type theories. We present a LF-style dependent type theory#N#extended with name-abstraction types, prove soundness and decidability of#N#beta-eta-equivalence checking, discuss adequacy and canonical forms via an#N#example, and discuss extensions such as dependently-typed recursion and#N#induction principles.

Connected through hyperedge HE-1 (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"
    - "abstract effects and proof relevant logical relations"

Connected through hyperedge HE-2 (induced by source paper "confusion of tagged perturbations in forward automatic differentiation of higher order functions"):
  with members:
    - "neural ordinary differential equations"
    - "learning to learn by gradient descent by gradient descent"
    - "evolving the incremental λ calculus into a model of forward automatic differentiation ad"
    - "diffsharp an ad library for net languages"

Connected through hyperedge HE-3 (induced by source paper "a simple sequent calculus for nominal logic"):
  with members:
    - "nominal logic programming"

Connected through hyperedge HE-4 (induced by source paper "nominal coalgebraic data types with applications to lambda calculus"):
  with members:
    - "semantics of higher order recursion schemes"

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)