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: "a syntactical analysis of non size increasing polynomial time computation"
  Abstract: A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof provides explicit polynomial bounds that can easily be calculated.

Connected through hyperedge HE-1 (induced by source paper "on paths based criteria for polynomial time complexity in proof nets"):
  with members:
    - "linear dependent types and relative completeness"
    - "linear logic by levels and bounded time complexity"
    - "on the complexity of stratified logics"
    - "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 "proof theory at work complexity analysis of term rewrite systems"):
  with members:
    - "automated complexity analysis based on the dependency pair method"
    - "the derivational complexity induced by the dependency pair method"
    - "satisfying kbo constraints"
    - "higher order termination from kruskal to computability"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-3 (induced by source paper "two algorithms in search of a type system"):
  with members:
    - "adventures in time and space"
    - "some applications of logic to feasibility in higher types"

Connected through hyperedge HE-4 (induced by source paper "time complexity semantics for feasible affine recursions extended abstract"):
  with members:
    - "adventures in time and space"

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)