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 "breaking symmetries in graph search with canonizing sets"):
  Abstract: There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of the large number of isomorphic representations of their solutions. This paper introduces effective and compact, complete symmetry breaking constraints for small graph search. Enumerating with these symmetry breaks generates all and only non-isomorphic solutions. For small search problems, with up to $10$ vertices, we compute instance independent symmetry breaking constraints. For small search problems with a larger number of vertices we demonstrate the computation of instance dependent constraints which are complete. We illustrate the application of complete symmetry breaking constraints to extend two known sequences from the OEIS related to graph enumeration. We also demonstrate the application of a generalization of our approach to fully-interchangeable matrix search problems.

Includes members:
  Member "breaking symmetry with different orderings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a commentary on breaking row and column symmetries in matrix models")
  Member "boolean equi propagation for concise and efficient sat encodings of combinatorial problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal depth sorting networks")
  Member "conflict anticipation in the search for graph automorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "correlation of automorphism group size and topological properties with program size complexity evaluations of graphs and complex networks")
  Member "symmetry breaking constraints recent results":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exploring the use of shatter for allsat through ramsey type problems")
  Member "graph symmetry detection and canonical labeling differences and synergies":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "dimension reduction via colour refinement")
  Member "on the complexity and completeness of static constraints for breaking row and column symmetry":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a commentary on breaking row and column symmetries in matrix models")

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.AI(Artificial Intelligence)