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: "an introduction to differential linear logic proof nets models and antiderivatives"
  Abstract: Differential Linear Logic enriches Linear Logic with additional logical rules for the exponential connectives, dual to the usual rules of dereliction, weakening and contraction. We present a proof-net syntax for Differential Linear Logic and a categorical axiomatization of its denotational models. We also introduce a simple categorical condition on these models under which a general antiderivative operation becomes available. Last we briefly describe the model of sets and relations and give a more detailed account of the model of finiteness spaces and linear and continuous functions.

Connected through hyperedge HE-1 (induced by source paper "backpropagation in the simply typed lambda calculus with linear negation"):
  with members:
    - "demystifying differentiable programming shift reset the penultimate backpropagator"
    - "the simple essence of automatic differentiation"
    - "proof nets and the linear substitution calculus"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-2 (induced by source paper "cartesian difference categories extended report"):
  with members:
    - "change actions models of generalised differentiation"
    - "fixing incremental computation derivatives of fixpoints and the recursive semantics of datalog"
    - "evolving the incremental λ calculus into a model of forward automatic differentiation ad"

Connected through hyperedge HE-3 (induced by source paper "differentials and distances in probabilistic coherence spaces"):
  with members:
    - "a domain theory for statistical probabilistic programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "full abstraction for probabilistic pcf"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-4 (induced by source paper "around finite second order coherence spaces"):
  with members:
    - "relational semantics of linear logic and higher order model checking"
    - "using models to model check recursive schemes"
    - "least and greatest fixed points in linear logic"
    - "a finite semantics of simply typed lambda terms for infinite runs of automata"

Connected through hyperedge HE-5 (induced by source paper "an application of parallel cut elimination in multiplicative linear logic to the taylor expansion of proof nets"):
  with members:
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "a finiteness structure on resource terms"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-6 (induced by source paper "coherent interaction graphs"):
  with members:
    - "interaction graphs graphings"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

Connected through hyperedge HE-7 (induced by source paper "jets and differential linear logic"):
  with members:
    - "reverse derivative categories"
    - "pde net 2 0 learning pdes from data with a numeric symbolic hybrid deep network"
    - "efficient neural architecture search via parameter sharing"
    - "cofree coalgebras and differential linear logic"
    - "neural architecture search with reinforcement learning"
    - "mackey complete spaces and power series a topological model of differential linear logic"
    - "a convenient differential category"

Connected through hyperedge HE-8 (induced by source paper "fixing incremental computation derivatives of fixpoints and the recursive semantics of datalog"):
  with members:
    - "change actions models of generalised differentiation"
    - "the simple essence of automatic differentiation"
    - "diffsharp an ad library for net languages"
    - "mackey complete spaces and power series a topological model of differential linear logic"
    - "automatic differentiation of algorithms for machine learning"

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)