human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a formal proof of pac learnability for decision stumps"):
  Abstract: We present a machine-checked, formal proof of PAC learnability of the concept class of decision stumps. A formal proof has every step checked and justified using fundamental axioms of mathematics. We construct and check our proof using the Lean theorem prover. Though such a proof appears simple, a few analytic and measure-theoretic subtleties arise when carrying it out fully formally. We explain how we can cleanly separate out the parts that deal with these subtleties by using Lean features and a category theoretic construction called the Giry monad.

Includes members:
  Member "guiding high performance sat solvers with unsat core predictions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "teaching temporal logics to neural networks")
  Member "gamepad a learning environment for theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "elementary logic in linear space")
  Member "holstep a machine learning dataset for higher order logic theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "elementary logic in linear space")
  Member "developing bug free machine learning systems with formal mathematics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a simple differentiable programming language")
  Member "on the expressive power of deep learning a tensor analysis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tensor networks for language modeling")
  Member "the foundational cryptography framework":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "symbolic abstractions for quantum protocol verification")

Question: Please tell me which class the source paper 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.LG(Machine Learning)