human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "efficient certified resolution proof checking"):
  Abstract: We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms a state-of-the-art checker by two orders of magnitude. We then formalize the theory underlying propositional proof checking in Coq, and extract a correct-by-construction proof checker for our format from the formalization. An empirical evaluation using 280 unsatisfiable instances from the 2015 and 2016 SAT competitions shows that this certified checker usually performs comparably to a state-of-the-art non-certified proof checker. Using this format, we formally verify the recent 200 TB proof of the Boolean Pythagorean Triples conjecture.

Includes members:
  Member "efficient certified rat verification":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "inconsistency proofs for asp the asp drupe format")
  Member "the drat format and drat trim checker":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "efficient certified rat verification")
  Member "solving and verifying the boolean pythagorean triples problem via cube and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "formalizing size optimal sorting networks extracting a certified proof checker":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimizing a certified proof checker for a large scale computer generated proof")
  Member "optimizing a certified proof checker for a large scale computer generated proof":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "formalizing size optimal sorting networks extracting a certified proof checker")
  Member "computer aided proof of erdos discrepancy properties":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "a framework for the verification of certifying computations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "discovering and certifying lower bounds for the online bin stretching problem")
  Member "formalization of abstract state transition systems for sat":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient certified rat verification")

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