human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "an abstract approach to stratification in linear logic"):
  Abstract: We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called "light" subsystems), from an abstract point of view, introducing a logical system in which stratification is handled by a separate modality. This modality, which is a generalization of the paragraph modality of Girard's light linear logic, arises from a general categorical construction applicable to all models of linear logic. We thus learn that stratification may be formulated independently of exponential modalities; when it is forced to be connected to exponential modalities, it yields interesting complexity properties. In particular, from our analysis stem three alternative reformulations of Baillot and Mazza's linear logic by levels: one geometric, one interactive, and one semantic.

Includes members:
  Member "linear logic by levels and bounded time complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "the relational model is injective for multiplicative exponential linear logic without weakenings":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "proof nets coends and the yoneda isomorphism")
  Member "verification of ptime reducibility for system f terms via dual light affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "light logics and the call by value lambda calculus")
  Member "light types for polynomial time computation in lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "optimizing optimal reduction a type inference algorithm for elementary affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear logic by levels and bounded time complexity")

Question: Please tell me which class the source paper 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)