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: "from coinductive proofs to exact real arithmetic theory and applications"
  Abstract: Based on a new coinductive characterization of continuous functions we#N#extract certified programs for exact real number computation from constructive#N#proofs. The extracted programs construct and combine exact real number#N#algorithms with respect to the binary signed digit representation of real#N#numbers. The data type corresponding to the coinductive definition of#N#continuous functions consists of finitely branching non-wellfounded trees#N#describing when the algorithm writes and reads digits. We discuss several#N#examples including the extraction of programs for polynomials up to degree two#N#and the definite integral of continuous maps.

Connected through hyperedge HE-1 (induced by source paper "intuitionistic fixed point logic"):
  with members:
    - "a coinductive approach to computing with compact sets"
    - "a proof of strong normalisation using domain theory"

Connected through hyperedge HE-2 (induced by source paper "an exponential lower bound for cunningham s rule"):
  with members:
    - "the simplex method is strongly polynomial for deterministic markov decision processes"
    - "an exponential lower bound for the latest deterministic strategy iteration algorithms"
    - "on the existence of hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes"

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)