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: "a semantic account of strong normalization in linear logic"
  Abstract: We prove that given two cut free nets of linear logic, by means of their relational interpretations one can: 1) first determine whether or not the net obtained by cutting the two nets is strongly normalizable 2) then (in case it is strongly normalizable) compute the maximal length of the reduction sequences starting from that net.

Connected through hyperedge HE-1 (induced by source paper "intersection type distributors"):
  with members:
    - "normalization taylor expansion and rigid approximation of λ terms"
    - "the bang calculus and the two girard s translations"
    - "proof nets coends and the yoneda isomorphism"

Connected through hyperedge HE-2 (induced by source paper "normalization taylor expansion and rigid approximation of λ terms"):
  with members:
    - "the bang calculus and the two girard s translations"
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"

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"
    - "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"
    - "the call by need lambda calculus revisited"
    - "lazy evaluation and delimited control"

Connected through hyperedge HE-4 (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"
    - "on the relative usefulness of fireballs"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-5 (induced by source paper "tight typings and split bounds"):
  with members:
    - "call by need neededness and all that"
    - "leftmost outermost beta reduction is invariant indeed"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "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)