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: "generic zero cost reuse for dependent types"
  Abstract: Dependently typed languages are well known for having a problem with code reuse. Traditional non-indexed algebraic datatypes (e.g. lists) appear alongside a plethora of indexed variations (e.g. vectors). Functions are often rewritten for both non-indexed and indexed versions of essentially the same datatype, which is a source of code duplication. #R##N#We work in a Curry-style dependent type theory, where the same untyped term may be classified as both the non-indexed and indexed versions of a datatype. Many solutions have been proposed for the problem of dependently typed reuse, but we exploit Curry-style type theory in our solution to not only reuse data and programs, but do so at zero-cost (without a runtime penalty). Our work is an exercise in dependently typed generic programming, and internalizes the process of zero-cost reuse as the identity function in a Curry-style theory.

Connected through hyperedge HE-1 (induced by source paper "elaborating inductive definitions and course of values induction in cedille"):
  with members:
    - "course of value induction in cedille"
    - "transporting functions across ornaments"
    - "elaborating inductive definitions"
    - "miniagda integrating sized and dependent types"
    - "inductive types in the calculus of algebraic constructions"

Connected through hyperedge HE-2 (induced by source paper "a role for dependent types in haskell extended version"):
  with members:
    - "models of type theory with strict equality"
    - "dependent types in haskell theory and practice"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "extending homotopy type theory with strict equality"
    - "on irrelevance and algorithmic equality in predicative type theory"

Connected through hyperedge HE-3 (induced by source paper "a weakly initial algebra for higher order abstract syntax in cedille"):
  with members:
    - "syntax and semantics of cedille"
    - "efficient mendler style lambda encodings in cedille"

Connected through hyperedge HE-4 (induced by source paper "elaborating inductive datatypes and course of values pattern matching to cedille"):
  with members:
    - "miniagda integrating sized and dependent 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.PL(Programming Languages)