human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "extensional proofs in a propositional logic modulo isomorphisms"):
  Abstract: System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys the strong normalization property. This is sufficient to prove the existence of empty types, but not to prove the introduction property (every normal closed term is an introduction). Moreover, a severe restriction had to be made on the types of the variables in order to obtain the existence of empty types. We show here that adding $\eta$-expansion rules to System I permit to drop this restriction and to retrieve full introduction property.

Includes members:
  Member "realizability in the unitary sphere":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "the vectorial λ calculus":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "typing quantum superpositions and measurement":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "realizability in the unitary sphere")
  Member "proof normalisation in a logic identifying isomorphic propositions":
    also connected through other hyperedges:
      (none)
  Member "isomorphisms considered as equalities projecting functions and enhancing partial application through an implementation of λ":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the exp log normal form of types decomposing extensional equality and representing terms compactly")
  Member "a system f accounting for scalars":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "linearity in the non deterministic call by value setting":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a fully abstract model for quantum controlled lambda calculus")
  Member "pure type systems without explicit contexts":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "proof normalisation in a logic identifying isomorphic propositions")

Question: Please tell me which class the source paper 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)