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: "simply typed lambda calculus modulo type isomorphisms"
  Abstract: We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.

Connected through hyperedge HE-1 (induced by source paper "the vectorial λ calculus"):
  with members:
    - "typing quantum superpositions and measurement"
    - "two linearities for quantum computing in the lambda calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "call by value call by name and the vectorial behaviour of the algebraic λ calculus"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"
    - "the probability of non confluent systems"

Connected through hyperedge HE-2 (induced by source paper "the exp log normal form of types decomposing extensional equality and representing terms compactly"):
  with members:
    - "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"
    - "axioms and decidability for type isomorphism in the presence of sums"
    - "focusing and polarization in intuitionistic logic"

Connected through hyperedge HE-3 (induced by source paper "isomorphism of intersection and union types"):
  with members:
    - "on isomorphism of functional intersection and union types"
    - "elaborating intersection and union types"

Connected through hyperedge HE-4 (induced by source paper "quantum superpositions and projective measurement in the lambda calculus"):
  with members:
    - "the vectorial λ calculus"
    - "quipper a scalable quantum programming language"
    - "applying quantitative semantics to higher order quantum computing"
    - "a system f accounting for scalars"
    - "linearity in the non deterministic call by value setting"

Connected through hyperedge HE-5 (induced by source paper "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ"):
  with members:
    - "the vectorial λ calculus"
    - "quantum superpositions and projective measurement in the lambda calculus"
    - "elaborating intersection and union types"
    - "call by value non determinism in a linear logic type discipline"
    - "non idempotent intersection types and strong normalisation"
    - "bounding normalization time through intersection types"
    - "a system f accounting for scalars"

Connected through hyperedge HE-6 (induced by source paper "deduction modulo theory"):
  with members:
    - "on completeness of reducibility candidates as a semantics of strong normalization"

Connected through hyperedge HE-7 (induced by source paper "on isomorphism of functional intersection and union types"):
  with members:
    - "isomorphism of intersection and union 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)