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 finiteness structure on resource terms"
  Abstract: In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's lambda-calculus with resources and based on ideas coming from differential linear logic and differential lambda-calculus. The good properties of this translation wrt. beta-reduction were guaranteed by a coherence relation on resource terms: normalization is "linear and stable" (in the sense of the coherence space semantics of linear logic) wrt. this coherence relation. Such coherence properties are lost when one considers non-deterministic or algebraic extensions of the lambda-calculus (the algebraic lambda-calculus is an extension of the lambda-calculus where terms can be linearly combined). We introduce a "finiteness structure" on resource terms which induces a linearly topologized vector space structure on terms and prevents the appearance of infinite coefficients during reduction, in typed settings.

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

Connected through hyperedge HE-2 (induced by source paper "the vectorial λ calculus"):
  with members:
    - "typing quantum superpositions and measurement"
    - "two linearities for quantum computing in the lambda calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "simply typed lambda calculus modulo type isomorphisms"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"

Connected through hyperedge HE-3 (induced by source paper "normalizing the taylor expansion of non deterministic lambda terms via parallel reduction of resource vectors"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "transport of finiteness structures and applications"
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-4 (induced by source paper "call by value call by name and the vectorial behaviour of the algebraic λ calculus"):
  with members:
    - "the vectorial λ calculus"
    - "full abstraction for the resource lambda calculus with tests through taylor expansion"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"

Connected through hyperedge HE-5 (induced by source paper "a system f accounting for scalars"):
  with members:
    - "semantics of a typed algebraic lambda calculus"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "algebraic totality towards completeness"
    - "reasoning about entanglement and separability in quantum higher order functions"
    - "quantum entanglement analysis based on abstract interpretation"
    - "a lambda calculus for quantum computation with classical control"
    - "probabilistic asynchronous pi calculus"

Connected through hyperedge HE-6 (induced by source paper "confluence via strong normalisation in an algebraic lambda calculus with rewriting"):
  with members:
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "linearity in the non deterministic call by value setting"
    - "semantics of a typed algebraic lambda calculus"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "algebraic totality towards completeness"
    - "probabilistic asynchronous pi calculus"

Connected through hyperedge HE-7 (induced by source paper "completeness of algebraic cps simulations"):
  with members:
    - "semantics of a typed algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "quantum entanglement analysis based on abstract interpretation"
    - "a lambda calculus for quantum computation with classical control"

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)