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: "the bang calculus and the two girard s translations"
  Abstract: We study the two Girard's translations of intuitionistic implication into linear logic by exploiting the bang calculus, a paradigmatic functional language with an explicit box-operator that allows both call-by-name and call-by-value lambda-calculi to be encoded in. We investigate how the bang calculus subsumes both call-by-name and call-by-value lambda-calculi from a syntactic and a semantic viewpoint.

Connected through hyperedge HE-1 (induced by source paper "intersection type distributors"):
  with members:
    - "normalization taylor expansion and rigid approximation of λ terms"
    - "proof nets coends and the yoneda isomorphism"
    - "a semantic account of strong normalization in linear logic"

Connected through hyperedge HE-2 (induced by source paper "the bang calculus revisited"):
  with members:
    - "tight typings and split bounds"
    - "the relational model is injective for multiplicative exponential linear logic"
    - "execution time of lambda terms via denotational semantics and intersection types"

Connected through hyperedge HE-3 (induced by source paper "normalization taylor expansion and rigid approximation of λ terms"):
  with members:
    - "strong normalizability as a finiteness structure via the taylor expansion of lambda terms"
    - "a semantic account of strong normalization in linear logic"

Connected through hyperedge HE-4 (induced by source paper "lambda calculus and probabilistic computation"):
  with members:
    - "confluence in probabilistic rewriting"
    - "on probabilistic term rewriting"
    - "the geometry of parallelism classical probabilistic and quantum effects"
    - "a lambda calculus foundation for universal probabilistic programming"
    - "toward general analysis of recursive probability models"
    - "church a language for generative models"
    - "probabilistic operational semantics for the lambda calculus"
    - "confluence results for a quantum lambda calculus with measurements"

Connected through hyperedge HE-5 (induced by source paper "on the elementary affine lambda calculus with and without fixed points"):
  with members:
    - "finitary semantics of linear logic and higher order model checking"
    - "light logics and the call by value lambda calculus"

Connected through hyperedge HE-6 (induced by source paper "a quantitative understanding of pattern matching"):
  with members:
    - "tight typings and split bounds"
    - "non idempotent intersection types and strong normalisation"

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)