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 "on paths based criteria for polynomial time complexity in proof nets"):
  Abstract: Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle and a "one-door" principle which were generalized later respectively in the systems L^4 and L^3a. Each system was brought with its own complex proof of Ptime soundness. #R##N#In this paper we propose a broad sufficient criterion for Ptime soundness for linear logic subsystems, based on the study of paths inside the proof-nets, which factorizes proofs of soundness of existing systems and may be used for future systems. As an additional gain, our bound stands for any reduction strategy whereas most bounds in the literature only stand for a particular strategy.

Includes members:
  Member "linear dependent types and relative completeness":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "session types with arithmetic refinements and their application to work analysis")
  Member "linear logic by levels and bounded time complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "on the complexity of stratified logics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "safe recursion on notation into a light logic by levels")
  Member "context semantics linear logic and computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "light types for polynomial time computation in lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "a syntactical analysis of non size increasing polynomial time computation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "proof theory at work complexity analysis of term rewrite systems")

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)