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: "deciding univariate polynomial problems using untrusted certificates in isabelle hol"
  Abstract: We present a proof procedure for univariate real polynomial problems in Isabelle/HOL. The core mathematics of our procedure is based on univariate cylindrical algebraic decomposition. We follow the approach of untrusted certificates, separating solving from verifying: efficient external tools perform expensive real algebraic computations, producing evidence that is formally checked within Isabelle’s logic. This allows us to exploit highly-tuned computer algebra systems like Mathematica to guide our procedure without impacting the correctness of its results. We present experiments demonstrating the efficacy of this approach, in many cases yielding orders of magnitude improvements over previous methods.

Connected through hyperedge HE-1 (induced by source paper "evaluating winding numbers and counting complex roots through cauchy indices in isabelle hol"):
  with members:
    - "formal proofs in real algebraic geometry from ordered fields to quantifier elimination"

Connected through hyperedge HE-2 (induced by source paper "from lcf to isabelle hol"):
  with members:
    - "interaction with formal mathematical documents in isabelle pide"
    - "computational logic its origins and applications"
    - "verifying strong eventual consistency in distributed systems"
    - "read eval print in parallel and asynchronous proof checking"
    - "integrating testing and interactive theorem proving"
    - "a formally verified compiler back end"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-3 (induced by source paper "counting polynomial roots in isabelle hol a formal proof of the budan fourier theorem"):
  with members:
    - "evaluating winding numbers and counting complex roots through cauchy indices in isabelle hol"
    - "computing real roots of real polynomials and now for real"
    - "formal proofs in real algebraic geometry from ordered fields to quantifier elimination"

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)