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 "a nonexistence certificate for projective planes of order ten with weight 15 codewords"):
  Abstract: Using techniques from the fields of symbolic computation and satisfiability checking we verify one of the cases used in the landmark result that projective planes of order ten do not exist. In particular, we show that there exist no projective planes of order ten that generate codewords of weight fifteen, a result first shown in 1973 via an exhaustive computer search. We provide a simple satisfiability (SAT) instance and a certificate of unsatisfiability that can be used to automatically verify this result for the first time. All previous demonstrations of this result have relied on search programs that are difficult or impossible to verify---in fact, our search found partial projective planes that were missed by previous searches due to previously undiscovered bugs. Furthermore, we show how the performance of the SAT solver can be dramatically increased by employing functionality from a computer algebra system (CAS). Our SAT+CAS search runs significantly faster than all other published searches verifying this result.

Includes members:
  Member "sat solvers and computer algebra systems a powerful combination for mathematics":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "enumeration of complex golay pairs via programmatic sat":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "applying computer algebra systems with sat solvers to the williamson conjecture")
  Member "a sat cas approach to finding good matrices new examples and counterexamples":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "applying computer algebra systems with sat solvers to the williamson conjecture")
  Member "schur number five":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "solving and verifying the boolean pythagorean triples problem via cube and conquer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "computing the ramsey number r 4 3 3 using abstraction and symmetry breaking":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimal depth sorting networks")
  Member "computer aided proof of erdos discrepancy properties":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "practical graph isomorphism ii":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hypergraph isomorphism for groups with restricted composition factors")

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)