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: "optimizing a certified proof checker for a large scale computer generated proof"
  Abstract: In recent work, we formalized the theory of optimal-size sorting networks with the goal of extracting a verified checker for the large-scale computer-generated proof that 25i¾?comparisons are optimal when sorting 9i¾?inputs, which required more than a decade of CPU time and produced 27i¾?GB of proof witnesses. The checker uses an untrusted oracle based on these witnesses and is able to verify the smaller case of 8i¾?inputs within a couple of days, but it did not scale to the full proof for 9 inputs. In this paper, we describe several non-trivial optimizations of the algorithm in the checker, obtained by appropriately changing the formalization and capitalizing on the symbiosis with an adequate implementation of the oracle. We provide experimental evidence of orders of magnitude improvements to both runtime and memory footprint for 8i¾?inputs, and actually manage to check the full proof for 9i¾?inputs.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "formalizing size optimal sorting networks extracting a certified proof checker"):
  with members:
    - "twenty five comparators is optimal when sorting nine inputs and twenty nine for ten"
    - "the certification problem format"
    - "efficient generation of correctness certificates for the abstract domain of polyhedra"

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)