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 equivalence and canonical forms in the lf type theory"
  Abstract: Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent, strongly-normalizing notion of reduction. Coquand has considered a different approach, directly proving the correctness of a practical equivalance algorithm based on the shape of terms. Neither approach appears to scale well to richer languages with unit types or subtyping, and neither directly addresses the problem of conversion to canonical. #R##N#In this paper we present a new, type-directed equivalence algorithm for the LF type theory that overcomes the weaknesses of previous approaches. The algorithm is practical, scales to richer languages, and yields a new notion of canonical form sufficient for adequate encodings of logical systems. The algorithm is proved complete by a Kripke-style logical relations argument similar to that suggested by Coquand. Crucially, both the algorithm itself and the logical relations rely only on the shapes of types, ignoring dependencies on terms.

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 type theory for defining logics and proofs"):
  with members:
    - "cocon computation in contextual type theory"
    - "on irrelevance and algorithmic equality in predicative type theory"

Connected through hyperedge HE-3 (induced by source paper "cocon computation in contextual type theory"):
  with members:
    - "on irrelevance and algorithmic equality in predicative type theory"

Connected through hyperedge HE-4 (induced by source paper "proof relevant horn clauses for dependent type inference and term synthesis"):
  with members:
    - "operational semantics of resolution and productivity in horn clause logic"
    - "proof relevant corecursive resolution"

Connected through hyperedge HE-5 (induced by source paper "depending on session typed processes"):
  with members:
    - "efficient csl model checking using stratification"
    - "parameterised multiparty session types"

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 irrelevance and algorithmic equality in predicative type theory"

Connected through hyperedge HE-7 (induced by source paper "a case study on logical relations using contextual types"):
  with members:
    - "reasoning in abella about structural operational semantics specifications"
    - "combining generic judgments with recursive definitions"
    - "the abella interactive theorem prover system description"
    - "mechanizing the metatheory of lf"

Connected through hyperedge HE-8 (induced by source paper "on irrelevance and algorithmic equality in predicative type theory"):
  with members:
    - "a modular type checking algorithm for type theory with singleton types and proof irrelevance"
    - "on the strength of proof irrelevant type theories"

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)