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 framework for the verification of certifying computations"
  Abstract: Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current automatic verification tools and usually involves intricate mathematical theorems. Certifying algorithms compute in addition to each output a witness certifying that the output is correct. A checker for such a witness is usually much simpler than the original algorithm - yet it is all the user has to trust. The verification of checkers is feasible with current tools and leads to computations that can be completely trusted. We describe a framework to seamlessly verify certifying computations. We use the automatic verifier VCC for establishing the correctness of the checker and the interactive theorem prover Isabelle/HOL for high-level mathematical properties of algorithms. We demonstrate the effectiveness of our approach by presenting the verification of typical examples of the industrial-level and widespread algorithmic library LEDA.

Connected through hyperedge HE-1 (induced by source paper "discovering and certifying lower bounds for the online bin stretching problem"):
  with members:
    - "trustworthy graph algorithms"
    - "online bin stretching with three bins"
    - "better algorithms for online bin stretching"

Connected through hyperedge HE-2 (induced by source paper "trustworthy graph algorithms"):
  with members:
    - "formalizing the solution to the cap set problem"
    - "a formally verified compiler back end"

Connected through hyperedge HE-3 (induced by source paper "efficient certified resolution proof checking"):
  with members:
    - "efficient certified rat verification"
    - "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"
    - "formalization of abstract state transition systems for sat"
    - "co c e spheres and cells in computable metric spaces"

Connected through hyperedge HE-4 (induced by source paper "certifying 3 edge connectivity"):
  with members:
    - "a simple test on 2 vertex and 2 edge connectivity"
    - "minimum cuts in near linear time"

Connected through hyperedge HE-5 (induced by source paper "applications of the gauss jordan algorithm done right"):
  with members:
    - "misfortunes of a mathematicians trio using computer algebra systems can we trust"
    - "isabelle the next 700 theorem provers"

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)