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: "weak affine light typing polytime intensional expressivity soundness and completeness"
  Abstract: Ridefinite Quasi-linear come Composition-linear Weak affine light typing ( WALT) assigns light affine linear formulae as types to a subset of λ-terms in System F. WALT is poly-time sound: if a λ-term M has type in WALT, M can be evaluated with a polynomial cost in the dimension of the derivation that gives it a type. In particul ar, the evaluation can proceed under any strategy of a rewriting relation, obtained as a mix of both call-by-name/call-by-value β-reductions. WALT is poly-time complete since it can represent any poly-time Turing machine. WALT weakens, namely generalizes, the notion of stratification of deductions common to some Light Systems — we call as such those logical systems, derived from Linear logic, to characterize FP, the set of Polynomial functions — . A weaker stratification a llows to define a compositional embedding of the Quasi-linear fragment QlSRN of Safe recursion on notation (SRN) into WALT. QlSRN is SRN, which is a recursive-theoretical system characterizing FP, where only the composition scheme is restricted to linear safe variables. So, the expressivity of WALT is stronger, as compared to the known Light Systems. In particular, using the types, the embedding puts in evidence the stratification of normal and safe argume nts hidden in QlSRN: the less an argument is impredicative, the deeper, in a formal, proof-theoretical sense, gets its representation in WALT.

Connected through hyperedge HE-1 (induced by source paper "on the complexity of stratified logics"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "least and greatest fixed points in linear logic"
    - "on quasi interpretations blind abstractions and implicit complexity"
    - "context semantics linear logic and computational complexity"
    - "soft lambda calculus a language for polynomial time computation"

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)