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 "from lcf to isabelle hol"):
  Abstract: Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents. Everything rests on the foundation conceived by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to ensure soundness and eliminate the need to store proofs. Compared with the research prototypes of the 1970s, Isabelle is a practical and versatile tool. It is used by system designers, mathematicians and many others.

Includes members:
  Member "deciding univariate polynomial problems using untrusted certificates in isabelle hol":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "evaluating winding numbers and counting complex roots through cauchy indices in isabelle hol")
  Member "interaction with formal mathematical documents in isabelle pide":
    also connected through other hyperedges:
      (none)
  Member "computational logic its origins and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "formalising mathematics in simple type theory")
  Member "verifying strong eventual consistency in distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "qed at large a survey of engineering of formally verified software")
  Member "read eval print in parallel and asynchronous proof checking":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interaction with formal mathematical documents in isabelle pide")
  Member "integrating testing and interactive theorem proving":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computer assisted proving of combinatorial conjectures over finite domains a case study of a chess conjecture")
  Member "a formally verified compiler back end":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a survey on theorem provers in formal methods")
  Member "natural deduction as higher order resolution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generating correctness proofs with neural networks")

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)