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 survey on theorem provers in formal methods"):
  Abstract: Mechanical reasoning is a key area of research that lies at the crossroads of mathematical logic and artificial intelligence. The main aim to develop mechanical reasoning systems (also known as theorem provers) was to enable mathematicians to prove theorems by computer programs. However, these tools evolved with time and now play vital role in the modeling and reasoning about complex and large-scale systems, especially safety-critical systems. Technically, mathematical formalisms and automated reasoning based-approaches are employed to perform inferences and to generate proofs in theorem provers. In literature, there is a shortage of comprehensive documents that can provide proper guidance about the preferences of theorem provers with respect to their designs, performances, logical frameworks, strengths, differences and their application areas. In this work, more than 40 theorem provers are studied in detail and compared to present a comprehensive analysis and evaluation of these tools. Theorem provers are investigated based on various parameters, which includes: implementation architecture, logic and calculus used, library support, level of automation, programming paradigm, programming language, differences and application areas.

Includes members:
  Member "comparison of two theorem provers isabelle hol and coq":
    also connected through other hyperedges:
      (none)
  Member "the boyer moore waterfall model revisited":
    also connected through other hyperedges:
      (none)
  Member "reinforcement learning of theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an experimental study of formula embeddings for automated theorem proving in first order logic")
  Member "qwire practice formal verification of quantum circuits in coq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "toward certified quantum programming")
  Member "proofwatch watchlist guidance for large theories in e":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "enigmawatch proofwatch meets enigma")
  Member "verifying asymptotic time complexity of imperative programs in isabelle":
    also connected through other hyperedges:
      (none)
  Member "formalized lambek calculus in higher order logic hol4":
    also connected through other hyperedges:
      (none)
  Member "the x86isa books features usage and future plans":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "adding 32 bit mode to the acl2 model of the x86 isa")

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.SE(Software Engineering)