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 "developments in formal proofs"):
  Abstract: This report describes three particular technological advances in formal proofs. The HOL Light proof assistant will be used to illustrate the design of a highly reliable system. Today, proof assistants can verify large bodies of advanced mathematics; and as an example, we turn to the formal proof in Coq of the Feit-Thompson Odd Order theorem in group theory. Finally, we discuss advances in the automation of formal proofs, as implemented in proof assistants such as Mizar, Coq, Isabelle, and HOL Light.

Includes members:
  Member "learning assisted theorem proving with millions of lemmas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "holist an environment for machine learning of higher order theorem proving")
  Member "a formally verified proof of the central limit theorem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formal verification of higher order probabilistic programs reasoning about approximation convergence bayesian inference and optimization")
  Member "premise selection for mathematics by corpus analysis and kernel methods":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "hol y hammer online atp service for hol light":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "enigma anonymous symbol independent inference guiding machine system description")
  Member "learning assisted automated reasoning with flyspeck":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")

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.LO(Logic in Computer Science)