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: "canonicity and normalisation for dependent type theory"
  Abstract: We show canonicity and normalization for dependent type theory with a cumulative sequence of universes and a type of Boolean. The argument follows the usual notion of reducibility, going back to Godel's Dialectica interpretation and the work of Tait. A key feature of our approach is the use of a proof relevant notion of reducibility.

Connected through hyperedge HE-1 (induced by source paper "cubical syntax for reflection free extensional equality"):
  with members:
    - "algebraic type theory and universe hierarchies"
    - "on higher inductive types in cubical type theory"
    - "design and implementation of the andromeda proof assistant"
    - "the redprl proof assistant invited paper"
    - "undecidability of equality in the free locally cartesian closed category extended version"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"

Connected through hyperedge HE-2 (induced by source paper "shallow embedding of type theory is morally correct"):
  with members:
    - "pointers in recursion exploring the tropics"
    - "axioms for modelling cubical type theory in a topos"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "quotient inductive inductive types"
    - "normalisation by evaluation for type theory in type theory"
    - "first steps in synthetic guarded domain theory step indexing in the topos of trees"

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)