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: "combining decision procedures for the reals"
  Abstract: We address the general problem of determining the validity of boolean com- binations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted forms of distributiv- ity. At the same time, we explore ways in which "local" decision or heuristic procedures for fragments of the theory of the reals can be amalgamated into global ones. Let Tadd(Q) be the first-order theory of the real numbers in the language with symbols 0,1,+, , <, . . . , fa, . . . where for each a 2 Q, fa denotes the function fa(x) = ax. Let Tmult(Q) be the analogous theory for the language with symbols 0,1,×,÷, <, . . . , fa, . . .. We show that although T(Q) = Tadd(Q) ( Tmult(Q) is undecidable, the universal fragment of T(Q) is decidable. We also show that terms of T(Q) can fruitfully be put in a normal form. We prove analogous results for theories in which Q is replaced, more generally, by suitable subfields F of the reals. Finally, we consider practical methods of establishing quantifier-free validities that approximate our (impractical) decidability results.

Connected through hyperedge HE-1 (induced by source paper "a heuristic prover for real inequalities"):
  with members:
    - "a formally verified proof of the central limit theorem"
    - "delta complete decision procedures for satisfiability over the reals"
    - "a formally verified proof of the prime number theorem"

Connected through hyperedge HE-2 (induced by source paper "a decision procedure for linear big o equations"):
  with members:
    - "linear encodings of bounded ltl model checking"
    - "a formally verified proof of the prime number theorem"

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)