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 feasible algorithm for typing in elementary affine logic"
  Abstract: We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant without sharing and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time.

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"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-2 (induced by source paper "light logics and the call by value lambda calculus"):
  with members:
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "light types for polynomial time computation in lambda calculus"
    - "soft lambda calculus a language for polynomial time computation"

Connected through hyperedge HE-3 (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 type inference in dual light affine logic"
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "context semantics linear logic and computational 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 "verification of ptime reducibility for system f terms type inference in dual light affine logic"):
  with members:
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "light types for polynomial time computation in lambda calculus"

Connected through hyperedge HE-5 (induced by source paper "verification of ptime reducibility for system f terms via dual light affine logic"):
  with members:
    - "light types for polynomial time computation in lambda calculus"

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 type inference in dual light affine logic"
    - "verification of ptime reducibility for system f terms via dual light affine logic"
    - "context semantics linear logic and computational complexity"
    - "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)