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 without weakenings"
  Abstract: We show that for Multiplicative Exponential Linear Logic (without weakenings) the syntactical equivalence relation on proofs induced by cut-elimination coincides with the semantic equivalence relation on proofs induced by the multiset based relational model: one says that the interpretation in the model (or the semantics) is injective. We actually prove a stronger result: two cut-free proofs of the full multiplicative and exponential fragment of linear logic whose interpretations coincide in the multiset based relational model are the same "up to the connections between the doors of exponential boxes".

Connected through hyperedge HE-1 (induced by source paper "proof nets coends and the yoneda isomorphism"):
  with members:
    - "a bifibrational reconstruction of lawvere s presheaf hyperdoctrine"
    - "from proof nets to the free autonomous category"

Connected through hyperedge HE-2 (induced by source paper "an abstract approach to stratification in linear logic"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "light types for polynomial time computation in lambda calculus"
    - "optimizing optimal reduction a type inference algorithm for elementary affine logic"

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

Connected through hyperedge HE-4 (induced by source paper "a semantic account of strong normalization in linear logic"):
  with members:
    - "the relational model is injective for multiplicative exponential linear logic"
    - "non idempotent intersection types and strong normalisation"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-5 (induced by source paper "on the discriminating power of tests in resource lambda calculus"):
  with members:
    - "full abstraction for the resource lambda calculus with tests through taylor expansion"

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)