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: "combining symmetry breaking and global constraints"
  Abstract: We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common global constraints. We give a general purpose propagator for this family of constraints, and show how to improve its complexity by exploiting properties of the included global constraints.

Connected through hyperedge HE-1 (induced by source paper "breaking symmetry with different orderings"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "breaking value symmetry"
    - "multiset ordering constraints"
    - "symmetries of symmetry breaking constraints"

Connected through hyperedge HE-2 (induced by source paper "symmetry breaking constraints recent results"):
  with members:
    - "the alldifferent constraint with precedences"
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "breaking value symmetry"
    - "multiset ordering constraints"
    - "symmetries of symmetry breaking constraints"

Connected through hyperedge HE-3 (induced by source paper "the regulargcc matrix constraint"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "slide a useful special case of the cardpath constraint"
    - "flow based propagators for the sequence and related global constraints"
    - "restricted global grammar constraints"

Connected through hyperedge HE-4 (induced by source paper "the alldifferent constraint with precedences"):
  with members:
    - "propagating conjunctions of alldifferent constraints"
    - "decompositions of all different global cardinality and related constraints"

Connected through hyperedge HE-5 (induced by source paper "parameterized complexity results in symmetry breaking"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "symmetry within and between solutions"
    - "breaking value symmetry"
    - "symmetries of symmetry breaking constraints"
    - "the parameterized complexity of global constraints"

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)