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: "proof nets and the linear substitution calculus"
  Abstract: Since the very beginning of the theory of linear logic it is known how to represent the $\lambda$-calculus as linear logic proof nets. The two systems however have different granularities, in particular proof nets have an explicit notion of sharing---the exponentials---and a micro-step operational semantics, while the $\lambda$-calculus has no sharing and a small-step operational semantics. Here we show that the \emph{linear substitution calculus}, a simple refinement of the $\lambda$-calculus with sharing, is isomorphic to proof nets at the operational level.  Nonetheless, two different terms with sharing can still have the same proof nets representation---a further result is the characterisation of the equality induced by proof nets over terms with sharing. Finally, such a detailed analysis of the relationship between terms and proof nets, suggests a new, abstract notion of proof net, based on rewriting considerations and not necessarily of a graphical nature.

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

Connected through hyperedge HE-2 (induced by source paper "backpropagation in the simply typed lambda calculus with linear negation"):
  with members:
    - "demystifying differentiable programming shift reset the penultimate backpropagator"
    - "the simple essence of automatic differentiation"
    - "an introduction to differential linear logic proof nets models and antiderivatives"
    - "tensorflow a system for large scale machine learning"

Connected through hyperedge HE-3 (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"
    - "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-4 (induced by source paper "strong bisimulation for control operators"):
  with members:
    - "non idempotent types for classical calculi in natural deduction style"
    - "a fully abstract semantics of lambda mu in the pi calculus"
    - "a theory of explicit substitutions with safe and full composition"

Connected through hyperedge HE-5 (induced by source paper "sharing equality is linear"):
  with members:
    - "on the relative usefulness of fireballs"
    - "maximal sharing in the lambda calculus with letrec"

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)