human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "types by need extended version"):
  Abstract: A cornerstone of the theory of lambda-calculus is that intersection types characterise termination properties. They are a flexible tool that can be adapted to various notions of termination, and that also induces adequate denotational models. #R##N#Since the seminal work of de Carvalho in 2007, it is known that multi types (i.e. non-idempotent intersection types) refine intersection types with quantitative information and a strong connection to linear logic. Typically, type derivations provide bounds for evaluation lengths, and minimal type derivations provide exact bounds. #R##N#De Carvalho studied call-by-name evaluation, and Kesner used his system to show the termination equivalence of call-by-need and call-by-name. De Carvalho's system, however, cannot provide exact bounds on call-by-need evaluation lengths. #R##N#In this paper we develop a new multi type system for call-by-need. Our system produces exact bounds and induces a denotational model of call-by-need, providing the first tight quantitative semantics of call-by-need.

Includes members:
  Member "towards a semantic measure of the execution time in call by value lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "crumbling abstract machines")
  Member "tight typings and split bounds":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the bang calculus revisited")
  Member "call by need neededness and all that":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "factoring derivation spaces via intersection types extended version")
  Member "proof nets and the linear substitution calculus":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the abstract machinery of interaction long version")
  Member "call by value non determinism in a linear logic type discipline":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards a semantic measure of the execution time in call by value lambda calculus")
  Member "non idempotent intersection types and strong normalisation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards a semantic measure of the execution time in call by value lambda calculus")
  Member "a semantic account of strong normalization in linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "intersection type distributors")
  Member "the call by need lambda calculus revisited":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hyperintensional reasoning based on natural language knowledge base")

Question: Please tell me which class the source paper 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)