human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "light logics and optimal reduction completeness and complexity"):
  Abstract: Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial (elementary, resp.) bound; on the other hand these terms can also be evaluated by optimal reduction using the abstract version of Lamping's algorithm. The first reduction is global while the second one is local and asynchronous. We prove that for LAL (EAL, resp.) typed terms, Lamping's abstract algorithm also admits a polynomial (elementary, resp.) bound. We also show its soundness and completeness (for EAL and LAL with type fixpoints), by using a simple geometry of interaction model (context semantics).

Includes members:
  Member "algorithms for omega regular games with imperfect information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "alternating tree automata with qualitative semantics")
  Member "verification of ptime reducibility for system f terms type inference in dual light affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "verification of ptime reducibility for system f terms via dual light affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an abstract approach to stratification in linear logic")
  Member "context semantics linear logic and computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "paths based criteria and application to linear logic subsystems characterizing polynomial time")
  Member "a feasible algorithm for typing in elementary affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "light types for polynomial time computation in lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "optimizing optimal reduction a type inference algorithm for elementary affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an abstract approach to stratification in linear logic")

Question: Please tell me which class the source paper 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)