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: "type classes for mathematics in type theory"
  Abstract: The introduction of first-class type classes in the Coq system calls for re-examination of the basic interfaces used for mathematical formalization in type theory. We present a new set of type classes for mathematics and take full advantage of their unique features to make practical a particularly flexible approach formerly thought infeasible. Thus, we address both traditional proof engineering challenges as well as new ones resulting from our ambition to build upon this development a library of constructive analysis in which abstraction penalties inhibiting efficient computation are reduced to a minimum. #R##N#The base of our development consists of type classes representing a standard algebraic hierarchy, as well as portions of category theory and universal algebra. On this foundation we build a set of mathematically sound abstract interfaces for different kinds of numbers, succinctly expressed using categorical language and universal algebra constructions. Strategic use of type classes lets us support these high-level theory-friendly definitions while still enabling efficient implementations unhindered by gratuitous indirection, conversion or projection. #R##N#Algebra thrives on the interplay between syntax and semantics. The Prolog-like abilities of type class instance resolution allow us to conveniently define a quote function, thus facilitating the use of reflective techniques.

Connected through hyperedge HE-1 (induced by source paper "tabled typeclass resolution"):
  with members:
    - "type classes for efficient exact real arithmetic in coq"
    - "xsb extending prolog with tabled logic programming"
    - "linear tabling strategies and optimizations"
    - "linear tabulated resolution based on prolog control strategy"

Connected through hyperedge HE-2 (induced by source paper "validating mathematical structures"):
  with members:
    - "the lean mathematical library"
    - "formalising perfectoid spaces"

Connected through hyperedge HE-3 (induced by source paper "the lean mathematical library"):
  with members:
    - "a formal proof of hensel s lemma over the p adic integers"
    - "counting immutable beans reference counting optimized for purely functional programming"
    - "a formalization of forcing and the unprovability of the continuum hypothesis"
    - "formalizing the solution to the cap set problem"
    - "formalising perfectoid spaces"
    - "formalizing computability theory via partial recursive functions"
    - "congruence closure in intensional type theory"

Connected through hyperedge HE-4 (induced by source paper "building on the diamonds between theories theory presentation combinators"):
  with members:
    - "rapid prototyping formal systems in mmt 5 case studies"
    - "biform theories project description"
    - "the biequivalence of locally cartesian closed categories and martin lof type theories"
    - "theory presentation combinators"
    - "the mathscheme library some preliminary experiments"
    - "a scalable module system"
    - "on duplication in mathematical repositories"

Connected through hyperedge HE-5 (induced by source paper "a formal proof of hensel s lemma over the p adic integers"):
  with members:
    - "an extensible ad hoc interface between lean and mathematica"
    - "homotopy type theory in lean"
    - "formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials"
    - "a heuristic prover for real inequalities"
    - "a formally verified proof of the prime number theorem"

Connected through hyperedge HE-6 (induced by source paper "rapid prototyping formal systems in mmt 5 case studies"):
  with members:
    - "the mmt api a generic mkm system"
    - "theory presentation combinators"
    - "a query language for formal mathematical libraries"
    - "a scalable module system"
    - "the abella interactive theorem prover system description"

Connected through hyperedge HE-7 (induced by source paper "formalizing the solution to the cap set problem"):
  with members:
    - "a formal proof of hensel s lemma over the p adic integers"
    - "homotopy type theory in lean"
    - "formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials"

Connected through hyperedge HE-8 (induced by source paper "the hott library a formalization of homotopy type theory in coq"):
  with members:
    - "formalising real numbers in homotopy type theory"
    - "partiality revisited the partiality monad as a quotient inductive inductive type"
    - "cubical type theory a constructive interpretation of the univalence axiom"
    - "hottsql proving query rewrites with univalent sql semantics"
    - "equations for hereditary substitution in leivant s predicative system f a case study"
    - "type classes for efficient exact real arithmetic in coq"

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)