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 "applying computer algebra systems with sat solvers to the williamson conjecture"):
  Abstract: Abstract   We employ tools from the fields of symbolic computation and satisfiability checking—namely, computer algebra systems and SAT solvers—to study the Williamson conjecture from combinatorial design theory and increase the bounds to which Williamson matrices have been enumerated. In particular, we completely enumerate all Williamson matrices of even order up to and including 70 which gives us deeper insight into the behaviour and distribution of Williamson matrices. We find that, in contrast to the case when the order is odd, Williamson matrices of even order are quite plentiful and exist in every even order up to and including 70. As a consequence of this and a new construction for 8-Williamson matrices we construct 8-Williamson matrices in all odd orders up to and including 35. We additionally enumerate all Williamson matrices whose orders are divisible by 3 and less than 70, finding one previously unknown set of Williamson matrices of order 63.

Includes members:
  Member "enumeration of complex golay pairs via programmatic sat":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a nonexistence certificate for projective planes of order ten with weight 15 codewords")
  Member "a sat cas approach to finding good matrices new examples and counterexamples":
    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 "schur number five":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten")
  Member "a sat attack on the erdos discrepancy conjecture":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal bounds for the no show paradox via sat solving")

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)