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: "call by value non determinism in a linear logic type discipline"
  Abstract: We consider the call-by-value λ-calculus extended with a may-convergent non-deterministic choice and a must-convergent parallel composition. Inspired by recent works on the relational semantics of linear logic and non-idempotent intersection types, we endow this calculus with a type system based on the so-called Girard’s second translation of intuitionistic logic into linear logic. We prove that a term is typable if and only if it is converging, and that its typing tree carries enough information to give a bound on the length of its lazy call-by-value reduction. Moreover, when the typing tree is minimal, such a bound becomes the exact length of the reduction.

Connected through hyperedge HE-1 (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"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "the call by need lambda calculus revisited"
    - "lazy evaluation and delimited control"

Connected through hyperedge HE-2 (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"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-3 (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"
    - "non idempotent intersection types and strong normalisation"
    - "a semantic account of strong normalization in linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-4 (induced by source paper "the vectorial λ calculus"):
  with members:
    - "typing quantum superpositions and measurement"
    - "two linearities for quantum computing in the lambda calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "simply typed lambda calculus modulo type isomorphisms"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"
    - "the probability of non confluent systems"

Connected through hyperedge HE-5 (induced by source paper "relational graph models at work"):
  with members:
    - "degrees of extensionality in the theory of b ohm trees and sall e s conjecture"

Connected through hyperedge HE-6 (induced by source paper "simply typed lambda calculus modulo type isomorphisms"):
  with members:
    - "non determinism through type isomorphism"
    - "the probability of non confluent systems"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "pure type systems without explicit contexts"
    - "a type system for the vectorial aspect of the linear algebraic lambda calculus"
    - "models and theories of lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"):
  with members:
    - "the vectorial λ calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "simply typed lambda calculus modulo type isomorphisms"
    - "elaborating intersection and union types"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"
    - "a system f accounting for scalars"

Connected through hyperedge HE-8 (induced by source paper "the probability of non confluent systems"):
  with members:
    - "the vectorial λ calculus"
    - "normalisation of a non deterministic type isomorphic lambda calculus"
    - "non determinism through type isomorphism"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"
    - "probabilistic operational semantics for the lambda calculus"
    - "pure type systems without explicit contexts"
    - "a type system for the vectorial aspect of the linear algebraic 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)