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: "affine functions and series with co inductive real numbers"
  Abstract: We extend the work of A. Ciaffaglione and P. Di Gianantonio on mechanical verification of algorithms for exact computation on real numbers, using infinite streams of digits implemented as co-inductive types. Four aspects are studied: the first aspect concerns the proof that digit streams can be related to the axiomatized real numbers that are already axiomatized in the proof system (axiomatized, but with no fixed representation). The second aspect re-visits the definition of an addition function, looking at techniques to let the proof search mechanism perform the effective construction of an algorithm that is correct by construction. The third aspect concerns the definition of a function to compute affine formulas with positive rational coefficients. This should be understood as a testbed to describe a technique to combine co-recursion and recursion to obtain a model for an algorithm that appears at first sight to be outside the expressive power allowed by the proof system. The fourth aspect concerns the definition of a function to compute series, with an application on the series that is used to compute Euler's number e. All these experiments should be reproducible in any proof system that supports co-inductive types, co-recursion and general forms of terminating recursion, but we performed with the Coq system [12, 3, 14].

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"
    - "a monadic functional implementation of 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"
    - "a monadic functional implementation of real numbers"

Connected through hyperedge HE-3 (induced by source paper "rationality and escalation in infinite extensive games"):
  with members:
    - "games and full completeness for multiplicative linear logic"
    - "on the rationality of escalation"
    - "deconstruction of infinite extensive games using coinduction"

Connected through hyperedge HE-4 (induced by source paper "from coinductive proofs to exact real arithmetic theory and applications"):
  with members:
    - "representations of stream processors using nested fixed points"
    - "coinductive formal reasoning in exact real arithmetic"

Connected through hyperedge HE-5 (induced by source paper "on the rationality of escalation"):
  with members:
    - "deconstruction of infinite extensive games using coinduction"

Connected through hyperedge HE-6 (induced by source paper "deconstruction of infinite extensive games using coinduction"):
  with members:
    - "games and full completeness for multiplicative linear logic"

Connected through hyperedge HE-7 (induced by source paper "inductive and coinductive components of corecursive functions in coq"):
  with members:
    - "general recursion via coinductive types"
    - "mechanizing coinduction and corecursion in higher order logic"

Connected through hyperedge HE-8 (induced by source paper "coinductive formal reasoning in exact real arithmetic"):
  with members:
    - "coinduction 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)