human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "change actions from incremental computation to discrete derivatives"):
  Abstract: The goal of this thesis is threefold: first, to provide a general semantic setting for reasoning about incremental computation. Second, to establish and clarify the connection between derivatives in the incremental sense and derivatives in the analytic sense, that is to say, to provide a common definition of derivative of which the previous two are particular instances. Third, to give a theoretically sound calculus for this general setting. To this end we define and explore the notions of change actions and differential maps between change actions and show how these notions relate to incremental computation through the concrete example of the semi-naive evaluation of Datalog queries. We also introduce the notion of a change action model as a setting for higher-order differentiation, and exhibit some interesting examples. Finally, we show how Cartesian difference categories, a family of particularly well-behaved change action models, generalise Cartesian differential categories and give rise to a calculus in the spirit of Ehrhard and Regnier's differential lambda-calculus.

Includes members:
  Member "the differential calculus of causal functions":
    also connected through other hyperedges:
      (none)
  Member "change actions models of generalised differentiation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "cartesian difference categories extended report")
  Member "differentiable causal computations via delayed trace":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the differential calculus of causal functions")
  Member "evolving the incremental λ calculus into a model of forward automatic differentiation ad":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "cartesian difference categories extended report")
  Member "mackey complete spaces and power series a topological model of differential linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "jets and differential linear logic")
  Member "rex recursive delta based data centric computation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "efficient iterative processing in the scidb parallel array engine")
  Member "a convenient differential category":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a differential form pullback programming language for higher order reverse mode automatic differentiation")
  Member "a computational definition of the notion of vectorial space":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the vectorial λ calculus")

Question: Please tell me which class the source paper 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)