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: "symmetry breaking constraints recent results"
  Abstract: Symmetry is an important problem in many combinatorial problems. One way of dealing with symmetry is to add constraints that eliminate symmetric solutions. We survey recent results in this area, focusing especially on two common and useful cases: symmetry breaking constraints for row and column symmetry, and symmetry breaking constraints for eliminating value symmetry

Connected through hyperedge HE-1 (induced by source paper "exploring the use of shatter for allsat through ramsey type problems"):
  with members:
    - "on local domain symmetry for model expansion"
    - "computing the ramsey number r 4 3 3 using abstraction and symmetry breaking"
    - "breaking symmetries in graph search with canonizing sets"
    - "practical graph isomorphism ii"

Connected through hyperedge HE-2 (induced by source paper "on local domain symmetry for model expansion"):
  with members:
    - "predicate logic as a modelling language the idp system"
    - "clingo asp control preliminary report"
    - "symmetry breaking answer set solving"

Connected through hyperedge HE-3 (induced by source paper "breakid static symmetry breaking for asp system description"):
  with members:
    - "predicate logic as a modelling language the idp system"
    - "symmetry breaking answer set solving"

Connected through hyperedge HE-4 (induced by source paper "breaking symmetries in graph search with canonizing sets"):
  with members:
    - "breaking symmetry with different orderings"
    - "boolean equi propagation for concise and efficient sat encodings of combinatorial problems"
    - "conflict anticipation in the search for graph automorphisms"
    - "graph symmetry detection and canonical labeling differences and synergies"
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"

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