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 computer verified monadic functional implementation of the integral"
  Abstract: We provide a computer-verified exact monadic functional implementation of the Riemann integral in type theory. Together with previous work by O'Connor, this may be seen as the beginning of the realization of Bishop's vision to use constructive mathematics as a programming language for exact analysis.

Connected through hyperedge HE-1 (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"
    - "type classes for efficient exact real arithmetic in coq"
    - "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"

Connected through hyperedge HE-2 (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"
    - "certified exact transcendental real number computation in coq"
    - "a monadic functional implementation of real numbers"
    - "affine functions and series with co inductive real numbers"

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

Connected through hyperedge HE-4 (induced by source paper "type classes for mathematics in type theory"):
  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.LO(Logic in Computer Science)