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: "on irrelevance and algorithmic equality in predicative type theory"
  Abstract: Dependently typed programs contain an excessive amount of static terms which#N#are necessary to please the type checker but irrelevant for computation. To#N#separate static and dynamic code, several static analyses and type systems have#N#been put forward. We consider Pfenning's type theory with irrelevant#N#quantification which is compatible with a type-based notion of equality that#N#respects eta-laws. We extend Pfenning's theory to universes and large#N#eliminations and develop its meta-theory. Subject reduction, normalization and#N#consistency are obtained by a Kripke model over the typed equality judgement.#N#Finally, a type-directed equality algorithm is described whose completeness is#N#proven by a second Kripke model.

Connected through hyperedge HE-1 (induced by source paper "a cubical language for bishop sets"):
  with members:
    - "cubical syntax for reflection free extensional equality"
    - "pointers in recursion exploring the tropics"
    - "design and implementation of the andromeda proof assistant"
    - "the redprl proof assistant invited paper"
    - "computational higher type theory iii univalent universes and exact equality"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "canonicity for cubical type theory"
    - "programming with algebraic effects and handlers"

Connected through hyperedge HE-2 (induced by source paper "a role for dependent types in haskell extended version"):
  with members:
    - "generic zero cost reuse for dependent types"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "a type theory for defining logics and proofs"):
  with members:
    - "cocon computation in contextual type theory"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-4 (induced by source paper "cocon computation in contextual type theory"):
  with members:
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-5 (induced by source paper "canonicity for cubical type theory"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "computational higher type theory i abstract cubical realizability"
    - "computational higher type theory ii dependent cubical realizability"
    - "the independence of markov s principle in type theory"
    - "a bi directional refinement algorithm for the calculus of co inductive constructions"

Connected through hyperedge HE-6 (induced by source paper "normalisation by evaluation for type theory in type theory"):
  with members:
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "on equivalence and canonical forms in the lf type theory"

Connected through hyperedge HE-7 (induced by source paper "the independence of markov s principle in type theory"):
  with members:
    - "stack semantics of type theory"

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.LO(Logic in Computer Science)