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: "realizability in the unitary sphere"
  Abstract: In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of typing rules for a simply-typed linear algebraic lambda-calculus, and show how it extends both to classical and quantum lambda-calculi.

Connected through hyperedge HE-1 (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms"):
  with members:
    - "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"
    - "linearity in the non deterministic call by value setting"
    - "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:
    - "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"
    - "linearity in the non deterministic call by value setting"
    - "a lambda calculus for quantum computation with classical control"

Connected through hyperedge HE-3 (induced by source paper "a categorical construction for the computational definition of vector spaces"):
  with members:
    - "a concrete categorical semantics of lambda s"
    - "confluence in probabilistic rewriting"
    - "typing quantum superpositions and measurement"
    - "call by value call by name and the vectorial behaviour of the algebraic λ 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)