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: "computer certified efficient exact reals 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. We provide an implementation of the exact real numbers in the Coq proof assistant. This improves on the earlier Coq-implementation by O'Connor in two ways: we use dyadic rationals built from the machine integers and we optimize computation of power series by using approximate division. Moreover, we use type classes for clean mathematical interfaces. This appears to be the first time that type classes are used in heavy computation. We obtain over a 100 times speed up of the basic operations and indications for improving the Coq system.

Connected through hyperedge HE-1 (induced by source paper "optimizing a certified proof checker for a large scale computer generated proof"):
  with members:
    - "formalizing size optimal sorting networks extracting a certified proof checker"
    - "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten"
    - "the certification problem format"
    - "efficient generation of correctness certificates for the abstract domain of polyhedra"
    - "certified exact transcendental real number computation in coq"

Connected through hyperedge HE-2 (induced by source paper "a certified reduction strategy for homological image processing"):
  with members:
    - "verifying an algorithm computing discrete vector fields for digital imaging"
    - "computing persistent homology within coq ssreflect"

Connected through hyperedge HE-3 (induced by source paper "formal proofs in real algebraic geometry from ordered fields to quantifier elimination"):
  with members:
    - "type classes for mathematics in type theory"

Connected through hyperedge HE-4 (induced by source paper "type classes for efficient exact real arithmetic in coq"):
  with members:
    - "nonuniform coercions via unification hints"
    - "a computer verified monadic functional implementation of the integral"
    - "certified exact transcendental real number computation in coq"
    - "a monadic functional implementation of real numbers"
    - "affine functions and series with co inductive real numbers"

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)