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 "a compact representation of terms and extensional equality at the exp log normal form of types"):
  Abstract: Lambda calculi with algebraic data types appear at the core of functional programming languages, but still pose theoretical challenges today: for instance, even in the presence of the simplest non-trivial data type, the sum type, we do not know how to assign a unique canonical normal form to a class of beta-eta-equal programs. In this paper, we present the exp-log normal form of types---derived from the representation of exponential polynomials via the unary exponential and logarithmic functions---that any type built from arrows, products, and sums, can be isomorphically mapped to, but that systematically minimizes the number of necessary sums in the type. We then reduce the standard beta-eta equational theory of the lambda calculus to a specialized version of itself, while preserving completeness of the equality of terms. Finally, we describe an alternative, more canonical, representation of terms of the lambda calculus with sums, together with a Coq-implemented type-directed partial evaluator into/from our new term calculus. This is the first heuristic for deciding interesting cases of beta-eta-equality that relies only on syntactic comparison of normal forms, and not on performing program analysis of the involved terms.

Includes members:
  Member "axioms and decidability for type isomorphism in the presence of sums":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the exp log normal form of types decomposing extensional equality and representing terms compactly")
  Member "focusing and polarization in intuitionistic logic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a sequent calculus proof search procedure and counter model generation based on natural deduction bounds")

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)