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: "soft lambda calculus a language for polynomial time computation"
  Abstract: Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. We prove that the (untyped) terms of this calculus are reducible in polynomial time. We then extend the type system of Soft logic with recursive types. This allows us to consider non-standard types for representing lists. Using these datatypes we examine the concrete expressivity of Soft lambda-calculus with the example of the insertion sort algorithm.

Connected through hyperedge HE-1 (induced by source paper "light logics and higher order processes"):
  with members:
    - "acyclic solos and differential interaction nets"
    - "orthomodular lattices foulis semigroups and dagger kernel categories"
    - "taming modal impredicativity superlazy reduction"

Connected through hyperedge HE-2 (induced by source paper "non idempotent intersection types and strong normalisation"):
  with members:
    - "a convenient differential category"
    - "a theory of explicit substitutions with safe and full composition"
    - "execution time of lambda terms via denotational semantics and intersection types"
    - "a proof of strong normalisation using domain theory"

Connected through hyperedge HE-3 (induced by source paper "quantitative classical realizability"):
  with members:
    - "realizability algebras a program to well order r"
    - "bounded linear logic revisited"
    - "church scott ptime an application of resource sensitive realizability"

Connected through hyperedge HE-4 (induced by source paper "a polynomial time lambda calculus with multithreading and side effects"):
  with members:
    - "light logics and higher order processes"
    - "resource control for synchronous cooperative threads"

Connected through hyperedge HE-5 (induced by source paper "typing a core binary field arithmetic in a light logic"):
  with members:
    - "verification of ptime reducibility for system f terms type inference in dual light affine logic"
    - "light types for polynomial time computation in lambda calculus"
    - "pelcr parallel environment for optimal lambda calculus reduction"

Connected through hyperedge HE-6 (induced by source paper "on the complexity of stratified logics"):
  with members:
    - "linear logic by levels and bounded time complexity"
    - "least and greatest fixed points in linear logic"
    - "weak affine light typing polytime intensional expressivity soundness and completeness"
    - "on quasi interpretations blind abstractions and implicit complexity"
    - "context semantics linear logic and computational complexity"

Connected through hyperedge HE-7 (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"
    - "a feasible algorithm for typing in elementary affine logic"
    - "light types for polynomial time computation in lambda calculus"

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)