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: "weak typed bohm theorem on imll"
  Abstract: Abstract   In the Bohm theorem workshop on Crete, Zoran Petric called Statman’s “Typical Ambiguity theorem” the typed Bohm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus.  In this paper, we study the linear version of the typed Bohm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment of intuitionistic linear logic without the multiplicative unit     1     (for short IMLL) the weak typed Bohm theorem holds. The system IMLL exactly corresponds to the linear lambda calculus with multiplicative pairing. The system IMLL also exactly corresponds to the free symmetric monoidal closed category without the unit object. As far as we know, our separation result is the first one with regard to these systems in a purely syntactical manner.

Connected through hyperedge HE-1 (induced by source paper "a type assignment of linear erasure and duplication"):
  with members:
    - "sublogarithmic uniform boolean proof nets"
    - "safe recursion on notation into a light logic by levels"
    - "safe recursion on notation into a light logic by levels"

Connected through hyperedge HE-2 (induced by source paper "taylor expansion in linear logic is invertible"):
  with members:
    - "proof equivalence in mll is pspace complete"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"
    - "non uniform hyper multi coherence spaces"

Connected through hyperedge HE-3 (induced by source paper "the relational model is injective for multiplicative exponential linear logic"):
  with members:
    - "the relational model is injective for multiplicative exponential linear logic without weakenings"
    - "non uniform hyper multi coherence spaces"

Connected through hyperedge HE-4 (induced by source paper "the relational model is injective for multiplicative exponential linear logic without weakenings"):
  with members:
    - "execution time of lambda terms via denotational semantics and intersection types"

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)