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: "enriching a linear non linear lambda calculus a programming language for string diagrams"
  Abstract: Linear/non-linear (LNL) models, as described by Benton, soundly model a LNL term calculus and LNL logic closely related to intuitionistic linear logic. Every such model induces a canonical enrichment that we show soundly models a LNL lambda calculus for string diagrams, introduced by Rios and Selinger (with primary application in quantum computing). Our abstract treatment of this language leads to simpler concrete models compared to those presented so far. We also extend the language with general recursion and prove soundness. Finally, we present an adequacy result for the diagram-free fragment of the language which corresponds to a modified version of Benton and Wadler's adjoint calculus with recursion.

Connected through hyperedge HE-1 (induced by source paper "realizability in the unitary sphere"):
  with members:
    - "a concrete categorical semantics of lambda s"
    - "typing quantum superpositions and measurement"
    - "quantum alternation prospects and problems"
    - "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-2 (induced by source paper "a framework for rewriting families of string diagrams"):
  with members:
    - "rewriting context free families of string diagrams"
    - "equational reasoning with context free families of string diagrams"
    - "quantomatic a proof assistant for diagrammatic reasoning"
    - "graphs with trivial overlap are context free"
    - "reasoning with graphs"

Connected through hyperedge HE-3 (induced by source paper "quantum programming with inductive datatypes causality and affine type theory"):
  with members:
    - "mixed linear and non linear recursive types"
    - "von neumann algebras form a model for the quantum lambda calculus"
    - "semantics of higher order quantum computation via geometry of interaction"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "semantics for a quantum programming language by operator algebras"

Connected through hyperedge HE-4 (induced by source paper "mixed linear and non linear recursive types"):
  with members:
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "the best of both worlds linear functional programming without compromise"
    - "applying quantitative semantics to higher order quantum computing"

Connected through hyperedge HE-5 (induced by source paper "lnl fpc the linear non linear fixpoint calculus"):
  with members:
    - "mixed linear and non linear recursive types"
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "the best of both worlds linear functional programming without compromise"

Connected through hyperedge HE-6 (induced by source paper "reflecting algebraically compact functors"):
  with members:
    - "mixed linear and non linear recursive types"

Connected through hyperedge HE-7 (induced by source paper "formalization of metatheory of the quipper quantum programming language in a linear logic"):
  with members:
    - "qwire practice formal verification of quantum circuits in coq"
    - "an open challenge problem repository for systems supporting binders"
    - "reasoning about higher order relational specifications"
    - "quipper a scalable quantum programming language"
    - "an improved implementation and abstract interface for hybrid"
    - "the abella interactive theorem prover system description"
    - "a lambda calculus for quantum computation with classical control"
    - "reasoning with higher order abstract syntax in a logical framework"

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)