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 central limit theorem"
  Abstract: We describe a proof of the Central Limit Theorem that has been formally verified in the Isabelle proof assistant. Our formalization builds upon and extends Isabelle's libraries for analysis and measure-theoretic probability. The proof of the theorem uses characteristic functions, which are a kind of Fourier transform, to demonstrate that, under suitable hypotheses, sums of random variables converge weakly to the standard normal distribution. We also discuss the libraries and infrastructure that supported the formalization, and reflect on some of the lessons we have learned from the effort.

Connected through hyperedge HE-1 (induced by source paper "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization"):
  with members:
    - "equivalence between wasserstein and value aware model based reinforcement learning"
    - "relational reasoning for markov chains in a probabilistic guarded lambda calculus"
    - "measurable cones and stable measurable functions a model for probabilistic higher order programming"
    - "mixed powerdomains for probability and nondeterminism"
    - "a convenient category for higher order probability theory"
    - "denotational validation of higher order bayesian inference"
    - "a theory of slicing for probabilistic control flow graphs"
    - "a relational logic for higher order programs"

Connected through hyperedge HE-2 (induced by source paper "computational logic its origins and applications"):
  with members:
    - "formalization of the fundamental group in untyped set theory using auto2"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"
    - "inductive analysis of the internet protocol tls"
    - "isabelle the next 700 theorem provers"

Connected through hyperedge HE-3 (induced by source paper "a verified compiler for probability density functions"):
  with members:
    - "deriving probability density functions from probabilistic functional programs"
    - "verifying probabilistic correctness in isabelle with pgcl"

Connected through hyperedge HE-4 (induced by source paper "developments in formal proofs"):
  with members:
    - "learning assisted theorem proving with millions of lemmas"
    - "premise selection for mathematics by corpus analysis and kernel methods"
    - "hol y hammer online atp service for hol light"
    - "learning assisted automated reasoning with flyspeck"

Connected through hyperedge HE-5 (induced by source paper "a heuristic prover for real inequalities"):
  with members:
    - "delta complete decision procedures for satisfiability over the reals"
    - "combining decision procedures for the reals"
    - "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.MS(Mathematical Software)