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 "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.

Includes members:
  Member "a modular type checking algorithm for type theory with singleton types and proof irrelevance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a cubical language for bishop sets")
  Member "on the strength of proof irrelevant type theories":
    also connected through other hyperedges:
      (none)
  Member "on equivalence and canonical forms in the lf type theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a cubical language for bishop sets")

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)