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: "light types for polynomial time computation in lambda calculus"
  Abstract: We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). #R##N#DLAL has a simple type language with a linear and an intuitionistic type arrow, and one modality. It corresponds to a fragment of Light affine logic (LAL). We show that contrarily to LAL, DLAL ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. We establish that as LAL, DLAL allows to represent all polytime functions. Finally we give a type inference procedure for propositional DLAL.

Connected through hyperedge HE-1 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows"):
  with members:
    - "linear haskell practical linearity in a higher order polymorphic language"
    - "the best of both worlds linear functional programming without compromise"
    - "type classes for lightweight substructural types"
    - "a lambda calculus for quantum computation with classical control"
    - "a feasible algorithm for typing in elementary affine logic"

Connected through hyperedge HE-2 (induced by source paper "prams over integers do not compute maxflow efficiently"):
  with members:
    - "characterizing co nl by a group action"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"
    - "interaction graphs full linear logic"
    - "towards a complexity through realizability theory"
    - "interaction graphs graphings"
    - "logic programming and logarithmic space"
    - "interaction graphs multiplicatives"
    - "interaction graphs additives"

Connected through hyperedge HE-3 (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"
    - "linear logic by levels and bounded time complexity"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "loop quasi invariant chunk motion by peeling with statement composition"):
  with members:
    - "interaction graphs full linear logic"
    - "interaction graphs additives"

Connected through hyperedge HE-5 (induced by source paper "infinitary λ calculi from a linear perspective long version"):
  with members:
    - "linear dependent types and relative completeness"
    - "coinductive big step operational semantics"

Connected through hyperedge HE-6 (induced by source paper "analysing the complexity of functional programs higher order meets first order long version"):
  with members:
    - "modular complexity analysis for term rewriting"
    - "a simple and scalable static analysis for bound analysis and amortized complexity analysis"
    - "a combination framework for complexity"
    - "linear dependent types and relative completeness"
    - "on constructor rewrite systems and the lambda calculus"
    - "automated complexity analysis based on the dependency pair method"
    - "call by value termination in the untyped lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "memoization for unary logic programming characterizing ptime"):
  with members:
    - "characterizing co nl by a group action"
    - "interaction graphs graphings"
    - "unification and logarithmic space"
    - "logic programming and logarithmic space"
    - "simulation of two way pushdown automata revisited"
    - "an implicit characterization of pspace"

Connected through hyperedge HE-8 (induced by source paper "an abstract approach to stratification in linear logic"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "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"
    - "optimizing optimal reduction a type inference algorithm for elementary affine logic"

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)