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: "linear logic by levels and bounded time complexity"
  Abstract: We give a new characterization of elementary and deterministic polynomial time computation in linear logic through the proofs-as-programs correspondence. Girard's seminal results, concerning elementary and light linear logic, achieve this characterization by enforcing a stratification principle on proofs, using the notion of depth in proof nets. Here, we propose a more general form of stratification, based on inducing levels in proof nets by means of indices, which allows us to extend Girard's systems while keeping the same complexity properties. In particular, it turns out that Girard's systems can be recovered by forcing depth and level to coincide. A consequence of the higher flexibility of levels with respect to depth is the absence of boxes for handling the paragraph modality. We use this fact to propose a variant of our polytime system in which the paragraph modality is only allowed on atoms, and which may thus serve as a basis for developing lambda-calculus type assignment systems with more efficient typing algorithms than existing ones.

Connected through hyperedge HE-1 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time"):
  with members:
    - "on paths based criteria for polynomial time complexity in proof nets"
    - "bounded linear logic revisited"
    - "verification of ptime reducibility for system f terms type inference in dual light affine logic"
    - "context semantics linear logic and computational complexity"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "an abstract approach to stratification in linear logic"):
  with members:
    - "the relational model is injective for multiplicative exponential linear logic without weakenings"
    - "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 "logic programming and logarithmic space"):
  with members:
    - "characterizing co nl by a group action"
    - "unification and logarithmic space"
    - "interaction graphs multiplicatives"
    - "two way finite automata old and recent results"
    - "an implicit characterization of pspace"
    - "bounded linear logic revisited"
    - "multi head finite automata characterizations concepts and open problems"

Connected through hyperedge HE-4 (induced by source paper "unification and logarithmic space"):
  with members:
    - "an implicit characterization of pspace"
    - "bounded linear logic revisited"

Connected through hyperedge HE-5 (induced by source paper "complexity analysis in presence of control operators and higher order functions long version"):
  with members:
    - "bounded linear logic revisited"
    - "light logics and optimal reduction completeness and complexity"

Connected through hyperedge HE-6 (induced by source paper "on paths based criteria for polynomial time complexity in proof nets"):
  with members:
    - "linear dependent types and relative completeness"
    - "on the complexity of stratified logics"
    - "context semantics linear logic and computational complexity"
    - "light types for polynomial time computation in lambda calculus"
    - "a syntactical analysis of non size increasing polynomial time computation"

Connected through hyperedge HE-7 (induced by source paper "on the complexity of stratified logics"):
  with members:
    - "least and greatest fixed points in linear logic"
    - "weak affine light typing polytime intensional expressivity soundness and completeness"
    - "on quasi interpretations blind abstractions and implicit complexity"
    - "context semantics linear logic and computational complexity"
    - "soft lambda calculus a language for polynomial time computation"

Connected through hyperedge HE-8 (induced by source paper "safe recursion on notation into a light logic by levels"):
  with members:
    - "on the complexity of stratified logics"

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)