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: "linearity in the non deterministic call by value setting"
  Abstract: We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity present in such formalisms. After proving the subject reduction and the strong normalisation properties, we propose a translation of this calculus into the System F with pairs, which corresponds to a non linear fragment of linear logic. The translation provides a deeper understanding of the linearity in our setting.

Connected through hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms"):
  with members:
    - "realizability in the unitary sphere"
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "proof normalisation in a logic identifying isomorphic propositions"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "a system f accounting for scalars"
    - "pure type systems without explicit contexts"

Connected through hyperedge HE-2 (induced by source paper "a fully abstract model for quantum controlled lambda calculus"):
  with members:
    - "realizability in the unitary sphere"
    - "the vectorial λ calculus"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "a concrete categorical semantics of lambda s"):
  with members:
    - "confluence in probabilistic rewriting"
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-4 (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-5 (induced by source paper "typing quantum superpositions and measurement"):
  with members:
    - "the vectorial λ calculus"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-6 (induced by source paper "two linearities for quantum computing in the lambda calculus"):
  with members:
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-7 (induced by source paper "quantum superpositions and projective measurement in the lambda calculus"):
  with members:
    - "the vectorial λ calculus"
    - "simply typed lambda calculus modulo type isomorphisms"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"

Connected through hyperedge HE-8 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions"):
  with members:
    - "the vectorial λ calculus"
    - "typing quantum superpositions and measurement"
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "pure type systems without explicit contexts"
    - "models and theories of lambda calculus"

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)