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: "tight typings and split bounds"
  Abstract: Multi types---aka non-idempotent intersection types---have been used to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of the result. Recent results show that the number of steps can be taken as a reasonable time complexity measure. At the same time, however, these results suggest that multi types provide quite lax complexity bounds, because the size of the result can be exponentially bigger than the number of steps. #R##N#Starting from this observation, we refine and generalise a technique introduced by Bernadet & Graham-Lengrand to provide exact bounds for the maximal strategy. Our typing judgements carry two counters, one measuring evaluation lengths and the other measuring result sizes. In order to emphasise the modularity of the approach, we provide exact bounds for four evaluation strategies, both in the lambda-calculus (head, leftmost-outermost, and maximal evaluation) and in the linear substitution calculus (linear head evaluation). #R##N#Our work aims at both capturing the results in the literature and extending them with new outcomes. Concerning the literature, it unifies de Carvalho and Bernadet & Graham-Lengrand via a uniform technique and a complexity-based perspective. The two main novelties are exact split bounds for the leftmost strategy---the only known strategy that evaluates terms to full normal forms and provides a reasonable complexity measure---and the observation that the computing device hidden behind multi types is the notion of substitution at a distance, as implemented by the linear substitution calculus.

Connected through hyperedge HE-1 (induced by source paper "the bang calculus revisited"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"

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"
    - "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"
    - "lazy evaluation and delimited control"

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:
    - "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"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-4 (induced by source paper "a game model for proofs with costs"):
  with members:
    - "relating reasoning methodologies in linear logic and process algebra"
    - "a proof theoretic study of soft concurrent constraint programming"
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-5 (induced by source paper "two formal systems of the lambda delta family revised"):
  with members:
    - "an extended type system with lambda typed lambda expressions"
    - "leftmost outermost beta reduction is invariant indeed"

Connected through hyperedge HE-6 (induced by source paper "a quantitative understanding of pattern matching"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "non idempotent intersection types and strong normalisation"

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.PL(Programming Languages)