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: "a formally verified proof of the prime number theorem"
  Abstract: The prime number theorem, established by Hadamard and de la Vall'ee Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1 / ln x. Whereas their proofs made serious use of the methods of complex analysis, elementary proofs were provided by Selberg and Erd"os in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.

Connected through hyperedge HE-1 (induced by source paper "a formal proof of hensel s lemma over the p adic integers"):
  with members:
    - "an extensible ad hoc interface between lean and mathematica"
    - "homotopy type theory in lean"
    - "formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials"
    - "a heuristic prover for real inequalities"
    - "type classes for mathematics in type theory"

Connected through hyperedge HE-2 (induced by source paper "a formal proof of the irrationality of ζ 3"):
  with members:
    - "formal proofs of transcendence for e and pi as an application of multivariate and symmetric polynomials"
    - "parametricity in an impredicative sort"
    - "formal proof of a wave equation resolution scheme the method error"

Connected through hyperedge HE-3 (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"
    - "combining decision procedures for the reals"

Connected through hyperedge HE-4 (induced by source paper "a decision procedure for linear big o equations"):
  with members:
    - "combining decision procedures for the reals"
    - "linear encodings of bounded ltl model checking"

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.AI(Artificial Intelligence)