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 "qed at large a survey of engineering of formally verified software"):
  Abstract: Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better understanding of program specifications and their underlying assumptions. Tools supporting such development have been available for over 40 years, but have only recently seen wide practical use. Projects based on construction of machine-checked formal proofs are now reaching an unprecedented scale, comparable to large software projects, which leads to new challenges in proof development and maintenance. Despite its increasing importance, the field of proof engineering is seldom considered in its own right; related theories, techniques, and tools span many fields and venues. This survey of the literature presents a holistic understanding of proof engineering for program correctness, covering impact in practice, foundations, proof automation, proof organization, and practical proof development.

Includes members:
  Member "bridging the gap between programming languages and hardware weak memory models":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconciling event structures with modern multiprocessors")
  Member "automatic software repair a bibliography":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a recurrent neural network based patch recommender for linux kernel bugs")
  Member "the redprl proof assistant invited paper":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a cubical language for bishop sets")
  Member "verifying strong eventual consistency in distributed systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "from lcf to isabelle hol")
  Member "algebraic foundations of proof refinement":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "computational higher type theory iv inductive types")
  Member "deep network guided proof search":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "teaching temporal logics to neural networks")
  Member "understanding and maintaining tactics graphically or how we are learning that a diagram can be worth more than 10k loc":
    also connected through other hyperedges:
      (none)
  Member "gradual certified programming in coq":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate normalization for gradual dependent types")

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)