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: "algebraic totality towards completeness"
  Abstract: Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give an interpretation of LL based on linear algebra. Second, thanks to separation properties, we can introduce an algebraic notion of totality candidate in the framework of linearly topologised spaces: a totality candidate is a closed affine subspace which does not contain 0. We show that finiteness spaces with totality candidates constitute a model of classical LL. Finally, we give a barycentric simply typed lambda-calculus, with booleans ${\mathcal{B}}$ and a conditional operator, which can be interpreted in this model. We prove completeness at type ${\mathcal{B}}^n\to{\mathcal{B}}$ for every n by an algebraic method.

Connected through hyperedge HE-1 (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-2 (induced by source paper "an introduction to differential linear logic proof nets models and antiderivatives"):
  with members:
    - "transport of finiteness structures and applications"

Connected through hyperedge HE-3 (induced by source paper "transport of finiteness structures and applications"):
  with members:
    - "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 finiteness structure on resource terms"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"

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 finiteness structure on resource terms"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "a computational definition of the notion of vectorial space"
    - "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 finiteness structure on resource terms"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "probabilistic asynchronous pi calculus"

Connected through hyperedge HE-7 (induced by source paper "a type system for the vectorial aspect of the linear algebraic lambda calculus"):
  with members:
    - "linearity in the non deterministic call by value setting"

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)