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: "efficient certified rat verification"
  Abstract: Clausal proofs have become a popular approach to validate the results of SAT solvers. However, validating clausal proofs in the most widely supported format (DRAT) is expensive even in highly optimized implementations. We present a new format, called LRAT, which extends the DRAT format with hints that facilitate a simple and fast validation algorithm. Checking validity of LRAT proofs can be implemented using trusted systems such as the languages supported by theorem provers. We demonstrate this by implementing two certified LRAT checkers, one in Coq and one in ACL2.

Connected through hyperedge HE-1 (induced by source paper "inconsistency proofs for asp the asp drupe format"):
  with members:
    - "asp core 2 input language format"
    - "shared aggregate sets in answer set programming"
    - "routing driverless transport vehicles in car assembly with answer set programming"
    - "textsf qrat generalizing qrat by a more powerful qbf redundancy property"
    - "vicious circle principle and logic programs with aggregates"
    - "team building with answer set programming in the gioia tauro seaport"
    - "detecting inconsistencies in large biological networks with answer set programming"
    - "trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs"

Connected through hyperedge HE-2 (induced by source paper "trimming graphs using clausal proof optimization"):
  with members:
    - "efficient certified resolution proof checking"

Connected through hyperedge HE-3 (induced by source paper "efficient certified resolution proof checking"):
  with members:
    - "the drat format and drat trim checker"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "formalizing size optimal sorting networks extracting a certified proof checker"
    - "optimizing a certified proof checker for a large scale computer generated proof"
    - "computer aided proof of erdos discrepancy properties"
    - "a framework for the verification of certifying computations"
    - "formalization of abstract state transition systems for sat"
    - "co c e spheres and cells in computable metric spaces"

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)