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: "change actions models of generalised differentiation"
  Abstract: Cai et al. have recently proposed change structures as a semantic framework for incremental computation. We generalise change structures to arbitrary cartesian categories and propose the notion of change action model as a categorical model for (higher-order) generalised differentiation. Change action models naturally arise from many geometric and computational settings, such as (generalised) cartesian differential categories, group models of discrete calculus, and Kleene algebra of regular expressions. We show how to build canonical change action models on arbitrary cartesian categories, reminiscent of the Faa di Bruno construction.

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"
    - "differentiable causal computations via delayed trace"
    - "evolving the incremental λ calculus into a model of forward automatic differentiation ad"
    - "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:
    - "fixing incremental computation derivatives of fixpoints and the recursive semantics of datalog"
    - "evolving the incremental λ calculus into a model of forward automatic differentiation ad"
    - "an introduction to differential linear logic proof nets models and antiderivatives"

Connected through hyperedge HE-3 (induced by source paper "fixing incremental computation derivatives of fixpoints and the recursive semantics of datalog"):
  with members:
    - "the simple essence of automatic differentiation"
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "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)