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 efficient exact real arithmetic in coq"
  Abstract: Floating point operations are fast, but require continuous effort on the part of the user in order to ensure that the results are correct. This burden can be shifted away from the user by providing a library of exact analysis in which the computer handles the error estimates. Previously, we [Krebbers/Spitters 2011] provided a fast implementation of the exact real numbers in the Coq proof assistant. Our implementation improved on an earlier implementation by O'Connor by using type classes to describe an abstract specification of the underlying dense set from which the real numbers are built. In particular, we used dyadic rationals built from Coq's machine integers to obtain a 100 times speed up of the basic operations already. This article is a substantially expanded version of [Krebbers/Spitters 2011] in which the implementation is extended in the various ways. First, we implement and verify the sine and cosine function. Secondly, we create an additional implementation of the dense set based on Coq's fast rational numbers. Thirdly, we extend the hierarchy to capture order on undecidable structures, while it was limited to decidable structures before. This hierarchy, based on type classes, allows us to share theory on the naturals, integers, rationals, dyadics, and reals in a convenient way. Finally, we obtain another dramatic speed-up by avoiding evaluation of termination proofs at runtime.

Connected through hyperedge HE-1 (induced by source paper "tabled typeclass resolution"):
  with members:
    - "type classes for mathematics in type theory"
    - "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 "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 mathematics in type theory"

Connected through hyperedge HE-3 (induced by source paper "exact real arithmetic with perturbation analysis and proof of correctness"):
  with members:
    - "certified exact transcendental real number computation in coq"

Connected through hyperedge HE-4 (induced by source paper "a formally verified proof of the central limit theorem"):
  with members:
    - "decidable classes of tree automata mixing local and global constraints modulo flat theories"

Connected through hyperedge HE-5 (induced by source paper "recycling proof patterns in coq case studies"):
  with members:
    - "ml4pg in computer algebra verification"
    - "statistical proof pattern recognition automated or interactive"
    - "a qualitative comparison of the suitability of four theorem provers for basic auction theory"
    - "proof pattern recognition and lemma discovery in acl2"
    - "decidable classes of tree automata mixing local and global constraints modulo flat theories"
    - "machine learning in proof general interfacing interfaces"
    - "computing persistent homology within coq ssreflect"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-6 (induced by source paper "wave equation numerical resolution a comprehensive mechanized proof of a c program"):
  with members:
    - "proof irrelevant model of cc with predicative induction and judgmental equality"
    - "a computer verified monadic functional implementation of the integral"
    - "formal proof of a wave equation resolution scheme the method error"
    - "certified exact transcendental real number computation in coq"
    - "a decision procedure for linear big o equations"
    - "certification of bounds on expressions involving rounded operators"

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)