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 "nonexistence certificates for ovals in a projective plane of order ten"):
  Abstract: In 1983, a computer search was performed for ovals in a projective plane of order ten. The search was exhaustive and negative, implying that such ovals do not exist. However, no nonexistence certificates were produced by this search, and to the best of our knowledge the search has never been independently verified. In this paper, we rerun the search for ovals in a projective plane of order ten and produce a collection of nonexistence certificates that, when taken together, imply that such ovals do not exist. Our search program uses the cube-and-conquer paradigm from the field of satisfiability (SAT) checking, coupled with a programmatic SAT solver and the nauty symbolic computation library for removing symmetries from the search.

Includes members:
  Member "applying computer algebra systems with sat solvers to the williamson conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the sat cas method for combinatorial search with applications to best matrices")
  Member "trimming graphs using clausal proof optimization":
    also connected through other hyperedges:
      (none)
  Member "sat solvers and computer algebra systems a powerful combination for mathematics":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a nonexistence certificate for projective planes of order ten with weight 15 codewords")
  Member "the sat cas method for combinatorial search with applications to best matrices":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sat solvers and computer algebra systems a powerful combination for mathematics")
  Member "a nonexistence certificate for projective planes of order ten with weight 15 codewords":
    also connected through other hyperedges:
      (none)
  Member "complex golay pairs up to length 28 a search via computer algebra and programmatic sat":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the sat cas method for combinatorial search with applications to best matrices")
  Member "schur number five":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "applying computer algebra systems with sat solvers to the williamson conjecture")
  Member "solving and verifying the boolean pythagorean triples problem via cube and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "applying computer algebra systems with sat solvers to the williamson conjecture")

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.DM(Discrete Mathematics)