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: "complex golay pairs up to length 28 a search via computer algebra and programmatic sat"
  Abstract: We use techniques from the fields of computer algebra and satisfiability checking to develop a new algorithm to search for complex Golay pairs. We implement this algorithm and use it to perform a complete search for complex Golay pairs of lengths up to 28. In doing so, we find that complex Golay pairs exist in the lengths 24 and 26 but do not exist in the lengths 23, 25, 27, and 28. This independently verifies work done by F. Fiedler in 2013 and confirms the 2002 conjecture of Craigen, Holzmann, and Kharaghani that complex Golay pairs of length 23 don't exist. Our algorithm is based on the recently proposed SAT+CAS paradigm of combining SAT solvers with computer algebra systems to efficiently search large spaces specified by both algebraic and logical constraints. The algorithm has two stages: first, a fine-tuned computer program uses functionality from computer algebra systems and numerical libraries to construct a list containing every sequence which could appear as the first sequence in a complex Golay pair up to equivalence. Second, a programmatic SAT solver constructs every sequence (if any) that pair off with the sequences constructed in the first stage to form a complex Golay pair. This extends work originally presented at the International Symposium on Symbolic and Algebraic Computation (ISSAC) in 2018; we discuss and implement several improvements to our algorithm that enabled us to improve the efficiency of the search and increase the maximum length we search from length 25 to 28.

Connected through hyperedge HE-1 (induced by source paper "nonexistence certificates for ovals in a projective plane of order ten"):
  with members:
    - "applying computer algebra systems with sat solvers to the williamson conjecture"
    - "trimming graphs using clausal proof optimization"
    - "sat solvers and computer algebra systems a powerful combination for mathematics"
    - "the sat cas method for combinatorial search with applications to best matrices"
    - "a nonexistence certificate for projective planes of order ten with weight 15 codewords"
    - "schur number five"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "computer aided proof of erdos discrepancy properties"

Connected through hyperedge HE-2 (induced by source paper "the sat cas method for combinatorial search with applications to best matrices"):
  with members:
    - "applying computer algebra systems with sat solvers to the williamson conjecture"
    - "enumeration of complex golay pairs via programmatic sat"
    - "a sat cas approach to finding good matrices new examples and counterexamples"
    - "schur number five"
    - "solving and verifying the boolean pythagorean triples problem via cube and conquer"
    - "green tao numbers and sat"
    - "satisfiability and computing van der waerden numbers"

Connected through hyperedge HE-3 (induced by source paper "sat solvers and computer algebra systems a powerful combination for mathematics"):
  with members:
    - "applying computer algebra systems with sat solvers to the williamson conjecture"
    - "the sat cas method for combinatorial search with applications to best matrices"
    - "enumeration of complex golay pairs via programmatic sat"
    - "a sat cas approach to finding good matrices new examples and counterexamples"
    - "computer aided proof of erdos discrepancy properties"

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.SC(Symbolic Computation)