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: "verification of ptime reducibility for system f terms type inference in dual light affine logic"
  Abstract: In a previous work Baillot and Terui introduced Dual light affine logic#N#(DLAL) as a variant of Light linear logic suitable for guaranteeing complexity#N#properties on lambda calculus terms: all typable terms can be evaluated in#N#polynomial time by beta reduction and all Ptime functions can be represented.#N#In the present work we address the problem of typing lambda-terms in#N#second-order DLAL. For that we give a procedure which, starting with a term#N#typed in system F, determines whether it is typable in DLAL and outputs a#N#concrete typing if there exists any. We show that our procedure can be run in#N#time polynomial in the size of the original Church typed system F term.

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"
    - "linear logic by levels and bounded time complexity"
    - "bounded linear logic revisited"
    - "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 "typing a core binary field arithmetic in a light logic"):
  with members:
    - "light types for polynomial time computation in lambda calculus"
    - "pelcr parallel environment for optimal lambda calculus reduction"
    - "soft lambda calculus a language for polynomial time computation"

Connected through hyperedge HE-3 (induced by source paper "linear logic by levels and bounded time complexity"):
  with members:
    - "algorithms for omega regular games with imperfect information"
    - "light logics and optimal reduction completeness and complexity"
    - "light types for polynomial time computation in lambda calculus"
    - "optimizing optimal reduction a type inference algorithm for elementary affine logic"

Connected through hyperedge HE-4 (induced by source paper "polynomial size analysis of first order shapely functions"):
  with members:
    - "resource control for synchronous cooperative threads"

Connected through hyperedge HE-5 (induced by source paper "light logics and optimal reduction completeness and complexity"):
  with members:
    - "algorithms for omega regular games with imperfect information"
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "context semantics linear logic and computational complexity"
    - "a feasible algorithm for typing in elementary 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-6 (induced by source paper "light types for polynomial time computation in lambda calculus"):
  with members:
    - "algorithms for omega regular games with imperfect information"
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "context semantics linear logic and computational complexity"
    - "a feasible algorithm for typing in elementary 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)