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: "a monadic functional implementation of real numbers"
  Abstract: Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the correctness of these proofs. This paper develops a new implementation of the constructive real numbers and elementary functions for such proofs by using the monad properties of the completion operation on metric spaces. Bishop and Bridges's notion (Bishop and Bridges 1985) of regular sequences is generalised to what I call regular functions, which form the completion of any metric space. Using the monad operations, continuous functions on length spaces (which are a common subclass of metric spaces) are created by lifting continuous functions on the original space. A prototype Haskell implementation has been created. I believe that this approach yields a real number library that is reasonably efficient for computation, and still simple enough to verify its correctness easily.

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

Connected through hyperedge HE-2 (induced by source paper "computer certified efficient exact reals in coq"):
  with members:
    - "type classes for mathematics in type theory"
    - "a computer verified monadic functional implementation of the integral"
    - "certified exact transcendental real number computation in coq"
    - "affine functions and series with co inductive real numbers"

Connected through hyperedge HE-3 (induced by source paper "a computer verified monadic functional implementation of the integral"):
  with members:
    - "certified exact transcendental real number computation in coq"
    - "computing with classical real numbers"
    - "a computer verified theory of compact sets"

Connected through hyperedge HE-4 (induced by source paper "a computer verified theory of compact sets"):
  with members:
    - "certified exact transcendental real number computation 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.NA(Numerical Analysis)