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: "on the relative usefulness of fireballs"
  Abstract: In CSL-LICS 2014, Accattoli and Dal Lago showed that there is an implementation of the ordinary (i.e. strong, pure, call-by-name) $\lambda$-calculus into models like RAM machines which is polynomial in the number of $\beta$-steps, answering a long-standing question. The key ingredient was the use of a calculus with useful sharing, a new notion whose complexity was shown to be polynomial, but whose implementation was not explored. This paper, meant to be complementary, studies useful sharing in a call-by-value scenario and from a practical point of view. We introduce the Fireball Calculus, a natural extension of call-by-value to open terms for which the problem is as hard as for the ordinary lambda-calculus. We present three results. First, we adapt the solution of Accattoli and Dal Lago, improving the meta-theory of useful sharing. Then, we refine the picture by introducing the GLAMoUr, a simple abstract machine implementing the Fireball Calculus extended with useful sharing. Its key feature is that usefulness of a step is tested---surprisingly---in constant time. Third, we provide a further optimization that leads to an implementation having only a linear overhead with respect to the number of $\beta$-steps.

Connected through hyperedge HE-1 (induced by source paper "the abstract machinery of interaction long version"):
  with members:
    - "crumbling abstract machines"
    - "proof nets and the linear substitution calculus"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "leftmost outermost beta reduction is invariant indeed"
    - "abstract machines for dialogue games"

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"
    - "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-3 (induced by source paper "crumbling abstract machines"):
  with members:
    - "towards a semantic measure of the execution time in call by value lambda calculus"
    - "standardization and conservativity of a refined call by value lambda calculus"
    - "leftmost outermost beta reduction is invariant indeed"
    - "a strong distillery"

Connected through hyperedge HE-4 (induced by source paper "sharing equality is linear"):
  with members:
    - "proof nets and the linear substitution calculus"
    - "maximal sharing in the lambda calculus with letrec"

Connected through hyperedge HE-5 (induced by source paper "implementing open call by value extended version"):
  with members:
    - "a strong distillery"
    - "on constructor rewrite systems and the lambda calculus"

Connected through hyperedge HE-6 (induced by source paper "the complexity of abstract machines"):
  with members:
    - "a strong distillery"
    - "an invariant cost model for the lambda calculus"

Connected through hyperedge HE-7 (induced by source paper "a strong distillery"):
  with members:
    - "execution time of lambda terms via denotational semantics and 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)