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: "evolving the incremental λ calculus into a model of forward automatic differentiation ad"
  Abstract: Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and derivatives of types. A newcomer to this list is the incremental λ-calculus, or ILC, a "theory of changes" that deploys a formal apparatus allowing the automatic generation of efficient update functions which perform incremental computation. The ILC is not only defined, but given a formal machine-understandable definition---accompanied by mechanically verifiable proofs of various properties, including in particular correctness of various sorts. Here, we show how the ILC can be mutated into propagating tangents, thus serving as a model of Forward Accumulation Mode Automatic Differentiation. This mutation is done in several steps. These steps can also be applied to the proofs, resulting in machine-checked proofs of the correctness of this model of forward AD.

Connected through hyperedge HE-1 (induced by source paper "change actions from incremental computation to discrete derivatives"):
  with members:
    - "the differential calculus of causal functions"
    - "change actions models of generalised differentiation"
    - "differentiable causal computations via delayed trace"
    - "mackey complete spaces and power series a topological model of differential linear logic"
    - "rex recursive delta based data centric computation"
    - "a convenient differential category"
    - "a computational definition of the notion of vectorial space"

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"
    - "an introduction to differential linear logic proof nets models and antiderivatives"

Connected through hyperedge HE-3 (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"
    - "diffsharp an ad library for net languages"
    - "a dependent nominal type theory"

Connected through hyperedge HE-4 (induced by source paper "change actions models of generalised differentiation"):
  with members:
    - "fixing incremental computation derivatives of fixpoints and the recursive semantics of datalog"
    - "a convenient differential category"

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)