human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a formally verified compiler back end"
  Abstract: This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its soundness. Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.

Connected through hyperedge HE-1 (induced by source paper "a survey on theorem provers in formal methods"):
  with members:
    - "comparison of two theorem provers isabelle hol and coq"
    - "the boyer moore waterfall model revisited"
    - "reinforcement learning of theorem proving"
    - "qwire practice formal verification of quantum circuits in coq"
    - "proofwatch watchlist guidance for large theories in e"
    - "verifying asymptotic time complexity of imperative programs in isabelle"
    - "formalized lambek calculus in higher order logic hol4"
    - "the x86isa books features usage and future plans"

Connected through hyperedge HE-2 (induced by source paper "from lcf to isabelle hol"):
  with members:
    - "deciding univariate polynomial problems using untrusted certificates in isabelle hol"
    - "interaction with formal mathematical documents in isabelle pide"
    - "computational logic its origins and applications"
    - "verifying strong eventual consistency in distributed systems"
    - "read eval print in parallel and asynchronous proof checking"
    - "integrating testing and interactive theorem proving"
    - "natural deduction as higher order resolution"
    - "the foundation of a generic theorem prover"

Connected through hyperedge HE-3 (induced by source paper "exorcising spectres with secure compilers"):
  with members:
    - "towards constant time foundations for the new spectre era"
    - "speculative buffer overflows attacks and defenses"
    - "spectector principled detection of speculative information flows"
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "you shall not bypass employing data dependencies to prevent bounds check bypass"
    - "spectre returns speculation attacks using the return stack buffer"
    - "ret2spec speculative execution using return stack buffers"

Connected through hyperedge HE-4 (induced by source paper "trace relating compiler correctness and secure compilation"):
  with members:
    - "the last mile high assurance and high speed cryptographic implementations"
    - "interaction trees representing recursive and impure programs in coq work in progress"
    - "journey beyond full abstraction exploring robust property preservation for secure compilation"
    - "beyond good and evil formalizing the security guarantees of compartmentalizing compilation"

Connected through hyperedge HE-5 (induced by source paper "embracing a mechanized formalization gap"):
  with members:
    - "from c to interaction trees specifying verifying and testing a networked server"
    - "a promise checked is a promise kept inspection testing"
    - "total haskell is reasonable coq"

Connected through hyperedge HE-6 (induced by source paper "understanding gcc builtins to develop better tools"):
  with members:
    - "introspection for c and its applications to library robustness"
    - "understanding the factors that impact the popularity of github repositories"

Connected through hyperedge HE-7 (induced by source paper "formal verification of trading in financial markets"):
  with members:
    - "a qualitative comparison of the suitability of four theorem provers for basic auction theory"
    - "maximizing matching in double sided auctions"

Connected through hyperedge HE-8 (induced by source paper "trustworthy graph algorithms"):
  with members:
    - "formalizing the solution to the cap set problem"
    - "a framework for the verification of certifying computations"

Question: Please tell me which class the center node 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)