human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "quantitative continuity and computable analysis in coq"):
  Abstract: We give a number of formal proofs of theorems from the field of computable analysis. Many of our results specify executable algorithms that work on infinite inputs by means of operating on finite approximations and are proven correct in the sense of computable analysis. The development is done in the proof assistant Coq and heavily relies on the Incone library for information theoretic continuity. This library is developed by one of the authors and the paper can be used as an introduction to the library as it describes many of its most important features in detail. While the ability to have full executability in a formal development of mathematical statements about real numbers and the like is not a feature that is unique to the Incone library, its original contribution is to adhere to the conventions of computable analysis to provide a general purpose interface for algorithmic reasoning on continuous structures. The results that provide complete computational content include that the algebraic operations and the efficient limit operator on the reals are computable, that certain countably infinite products are isomorphic to spaces of functions, compatibility of the enumeration representation of subsets of natural numbers with the abstract definition of the space of open subsets of the natural numbers, and that continuous realizability implies sequential continuity. We also formalize proofs of non-computational results that support the correctness of our definitions. These include that the information theoretic notion of continuity used in the library is equivalent to the metric notion of continuity on Baire space, a complete comparison of the different concepts of continuity that arise from metric and represented-space structures and the discontinuity of the unrestricted limit operator on the real numbers and the task of selecting an element of a closed subset of the natural numbers.

Includes members:
  Member "type two polynomial time and restricted lookahead":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "type two iteration with bounded query revision")
  Member "bounded time computation on metric spaces and banach spaces":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "parametrised second order complexity theory with applications to the study of interval computation")
  Member "representations and evaluation strategies for feasibly approximable functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "implementing evaluation strategies for continuous real functions")
  Member "parametrised second order complexity theory with applications to the study of interval computation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "real number computability from the perspective of computer assisted proofs in analysis")
  Member "comparing representations for function spaces in computable analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a topological view on algebraic computation models")
  Member "function spaces for second order polynomial time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "parametrised second order complexity theory with applications to the study of interval computation")
  Member "wave equation numerical resolution a comprehensive mechanized proof of a c program":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "automatic generation and verification of test stable floating point code")
  Member "complexity theory for operators in analysis":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on higher order cryptography long version")

Question: Please tell me which class the source paper 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)