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 "towards a semantic measure of the execution time in call by value lambda calculus"):
  Abstract: We investigate the possibility of a semantic account of the execution time (i.e. the number of beta-steps leading to the normal form, if any) for the shuffling calculus, an extension of Plotkin's call-by-value lambda-calculus. For this purpose, we use a linear logic based denotational model that can be seen as a non-idempotent intersection type system: relational semantics. Our investigation is inspired by similar ones for linear logic proof-nets and untyped call-by-name lambda-calculus. We first prove a qualitative result: a (possibly open) term is normalizable for weak reduction (which does not reduce under abstractions) if and only if its interpretation is not empty. We then show that the size of type derivations can be used to measure the execution time. Finally, we show that, differently from the case of linear logic and call-by-name lambda-calculus, the quantitative information enclosed in type derivations does not lift to types (i.e. to the interpretation of terms). To get a truly semantic measure of execution time in a call-by-value setting, we conjecture that a refinement of its syntax and operational semantics is needed.

Includes members:
  Member "tight typings and split bounds":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the bang calculus revisited")
  Member "towards a semantic measure of the execution time in call by value lambda calculus long version":
    also connected through other hyperedges:
      (none)
  Member "standardization and conservativity of a refined call by value lambda calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "crumbling abstract machines")
  Member "on the relative usefulness of fireballs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "types by need extended version")
  Member "non idempotent intersection types and strong normalisation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "types by need extended version")
  Member "a semantic account of strong normalization in linear logic":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "intersection type distributors")
  Member "execution time of lambda terms via denotational semantics and intersection types":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the bang calculus revisited")

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)