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: "the relational model is injective for multiplicative exponential linear logic"
  Abstract: We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination.

Connected through hyperedge HE-1 (induced by source paper "the bang calculus revisited"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "tight typings and split bounds"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-2 (induced by source paper "an application of parallel cut elimination in multiplicative linear logic to the taylor expansion of proof nets"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"
    - "a finiteness structure on resource terms"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-3 (induced by source paper "tight typings and split bounds"):
  with members:
    - "call by need neededness and all that"
    - "leftmost outermost beta reduction is invariant indeed"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-4 (induced by source paper "taylor expansion in linear logic is invertible"):
  with members:
    - "proof equivalence in mll is pspace complete"
    - "execution time of lambda terms via denotational semantics and intersection types"
    - "weak typed bohm theorem on imll"
    - "non uniform hyper multi coherence spaces"

Connected through hyperedge HE-5 (induced by source paper "a semantic account of strong normalization in linear logic"):
  with members:
    - "non idempotent intersection types and strong normalisation"
    - "the relational model is injective for multiplicative exponential linear logic without weakenings"
    - "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)