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: "bit blasting acl2 theorems"
  Abstract: Interactive theorem proving requires a lot of human guidance. Proving a property involves (1) figuring out why it holds, then (2) coaxing the theorem prover into believing it. Both steps can take a long time. We explain how to use GL, a framework for proving finite ACL2 theorems with BDD- or SAT-based reasoning. This approach makes it unnecessary to deeply understand why a property is true, and automates the process of admitting it as a theorem. We use GL at Centaur Technology to verify execution units for x86 integer, MMX, SSE, and floating-point arithmetic.

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 "verifying x86 instruction implementations"):
  with members:
    - "adding 32 bit mode to the acl2 model of the x86 isa"
    - "term level reasoning in support of bit blasting"

Connected through hyperedge HE-3 (induced by source paper "proceedings of the 15th international workshop on the acl2 theorem prover and its applications a toolbox for property checking from simulation using incremental sat extended abstract"):
  with members:
    - "proceedings twelfth international workshop on the acl2 theorem prover and its applications"
    - "proceedings international workshop on the acl2 theorem prover and its applications"
    - "verified aig algorithms in acl2"
    - "proceedings 10th international workshop on the acl2 theorem prover and its applications"

Connected through hyperedge HE-4 (induced by source paper "incremental sat library integration using abstract stobjs"):
  with members:
    - "extending acl2 with smt solvers"
    - "verified aig algorithms in acl2"
    - "abstract stobjs and their application to isa modeling"

Connected through hyperedge HE-5 (induced by source paper "adding 32 bit mode to the acl2 model of the x86 isa"):
  with members:
    - "the x86isa books features usage and future plans"
    - "a versatile sound tool for simplifying definitions"
    - "abstract stobjs and their application to isa modeling"

Connected through hyperedge HE-6 (induced by source paper "term level reasoning in support of bit blasting"):
  with members:
    - "fix your types"

Connected through hyperedge HE-7 (induced by source paper "the x86isa books features usage and future plans"):
  with members:
    - "abstract stobjs and their application to isa modeling"

Connected through hyperedge HE-8 (induced by source paper "fix your types"):
  with members:
    - "polymorphic types in acl2"
    - "development of a translator from llvm to acl2"
    - "data definitions in the acl2 sedan"
    - "a formalisation of xmas"
    - "abstract stobjs and their application to isa modeling"

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)