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: "non idempotent intersection types and strong normalisation"
  Abstract: We present a typing system with non-idempotent intersection types, typing a#N#term syntax covering three different calculi: the pure {\lambda}-calculus, the#N#calculus with explicit substitutions {\lambda}S, and the calculus with explicit#N#substitutions, contractions and weakenings {\lambda}lxr. In each of the three#N#calculi, a term is typable if and only if it is strongly normalising, as it is#N#the case in (many) systems with idempotent intersections. Non-idempotency#N#brings extra information into typing trees, such as simple bounds on the#N#longest reduction sequence reducing a term to its normal form. Strong#N#normalisation follows, without requiring reducibility techniques. Using this,#N#we revisit models of the {\lambda}-calculus based on filters of intersection#N#types, and extend them to {\lambda}S and {\lambda}lxr. Non-idempotency#N#simplifies a methodology, based on such filter models, that produces modular#N#proofs of strong normalisation for well-known typing systems (e.g. System F).#N#We also present a filter model by means of orthogonality techniques, i.e. as an#N#instance of an abstract notion of orthogonality model formalised in this paper#N#and inspired by classical realisability. Compared to other instances based on#N#terms (one of which rephrases a now standard proof of strong normalisation for#N#the {\lambda}-calculus), the instance based on filters is shown to be better at#N#proving strong normalisation results for {\lambda}S and {\lambda}lxr. Finally,#N#the bounds on the longest reduction sequence, read off our typing trees, are#N#refined into an exact measure, read off a specific typing tree (called#N#principal); in each of the three calculi, a specific reduction sequence of such#N#length is identified. In the case of the {\lambda}-calculus, this complexity#N#result is, for longest reduction sequences, the counterpart of de Carvalho's#N#result for linear head-reduction sequences.

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"
    - "call by value non determinism in a linear logic type discipline"
    - "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"
    - "call by value non determinism in a linear logic type discipline"
    - "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 "a quantitative understanding of pattern matching"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "tight typings and split bounds"

Connected through hyperedge HE-4 (induced by source paper "factoring derivation spaces via intersection types extended version"):
  with members:
    - "call by need neededness and all that"

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

Connected through hyperedge HE-6 (induced by source paper "non idempotent types for classical calculi in natural deduction style"):
  with members:
    - "sound and complete typing for lambda mu"
    - "a theory of explicit substitutions with safe and full composition"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-7 (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"
    - "call by value non determinism in a linear logic type discipline"
    - "bounding normalization time through intersection types"
    - "the probability of non confluent systems"

Connected through hyperedge HE-8 (induced by source paper "inhabitation for non idempotent intersection types"):
  with members:
    - "mixin composition synthesis based on intersection types"
    - "the inhabitation problem for rank two intersection types"

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)