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 the call by value lambda calculus"):
  Abstract: The so-called light logics have been introduced as logical systems enjoying#N#quite remarkable normalization properties. Designing a type assignment system#N#for pure lambda calculus from these logics, however, is problematic. In this#N#paper we show that shifting from usual call-by-name to call-by-value lambda#N#calculus allows regaining strong connections with the underlying logic. This#N#will be done in the context of Elementary Affine Logic (EAL), designing a type#N#system in natural deduction style assigning EAL formulae to lambda terms.

Includes members:
  Member "verification of ptime reducibility for system f terms via dual light affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an abstract approach to stratification in linear logic")
  Member "a feasible algorithm for typing in elementary affine logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (induced by source paper "a modular inference of linear types for multiplicity annotated arrows")
  Member "soft lambda calculus a language for polynomial time computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "light logics and higher order processes")

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)