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: "execution time of lambda terms via denotational semantics and intersection types"
  Abstract: The multiset based relational model of linear logic induces a semantics of the type free lambda-calculus, which corresponds to a non-idempotent intersection type system, System R. We prove that, in System R, the size of the type derivations and the size of the types are closely related to the execution time of lambda-terms in a particular environment machine, Krivine's machine.

Connected through hyperedge HE-1 (induced by source paper "the bang calculus revisited"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "tight typings and split bounds"
    - "the relational model is injective for multiplicative exponential linear logic"

Connected through hyperedge HE-2 (induced by source paper "types by need extended version"):
  with members:
    - "towards a semantic measure of the execution time in call by value lambda calculus"
    - "tight typings and split bounds"
    - "call by need neededness and all that"
    - "proof nets and the linear substitution calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "the call by need lambda calculus revisited"

Connected through hyperedge HE-3 (induced by source paper "towards a semantic measure of the execution time in call by value lambda calculus"):
  with members:
    - "tight typings and split bounds"
    - "towards a semantic measure of the execution time in call by value lambda calculus long version"
    - "standardization and conservativity of a refined call by value lambda calculus"
    - "on the relative usefulness of fireballs"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"

Connected through hyperedge HE-4 (induced by source paper "differentials and distances in probabilistic coherence spaces"):
  with members:
    - "a domain theory for statistical probabilistic programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "full abstraction for probabilistic pcf"

Connected through hyperedge HE-5 (induced by source paper "an application of parallel cut elimination in multiplicative linear logic to the taylor expansion of proof nets"):
  with members:
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "a finiteness structure on resource terms"

Connected through hyperedge HE-6 (induced by source paper "non idempotent intersection types in logical form"):
  with members:
    - "the delta calculus syntax and types"
    - "relational graph models at work"

Connected through hyperedge HE-7 (induced by source paper "tight typings and split bounds"):
  with members:
    - "call by need neededness and all that"
    - "leftmost outermost beta reduction is invariant indeed"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"

Connected through hyperedge HE-8 (induced by source paper "observability typability inhabitation"):
  with members:
    - "inhabitation for non idempotent intersection types"
    - "no solvable lambda value term left behind"
    - "on the implementation of dynamic patterns"

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)