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 "deduction modulo theory"):
  Abstract: Contemporary proof theory goes into several directions at the same time. One of them aims at analysing proofs, propositions, connectives, etc., that is at decomposing these objects into more atomic ones. This often leads to design systems that are weaker than Predicate logic, but that have better algebraic or computational properties, and to try to reconstruct part of Predicate logic on top of these systems. Propositional logic, linear logic, deep inference, equational logic, explicit substitution calculi, etc. are examples of such systems. From this view point, Predicate logic appears more as the ultimate goal of the journey, than as its starting point. Another direction considers that very little can be expressed in pure Predicate logic and that stronger systems are needed, for instance to express genuine mathematical proofs. Axiomatic theories, modal logics, types theories, etc. are examples of such systems that are more expressive than pure Predicate logic. There, Predicate logic is the starting point of the journey. Although both points of view coexist in many research projects, these two approaches to proof theory often lead to different systems and different problems. Deduction modulo theory is part of the second group, as it focuses on proofs in theories. The concern of integrating theories to proof theory is that of several research groups. See, for instance, [48] and [50] for related approaches.

Includes members:
  Member "simply typed lambda calculus modulo type isomorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the vectorial λ calculus")
  Member "on completeness of reducibility candidates as a semantics of strong normalization":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on completeness and parametricity in the realizability semantics of system f")

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)