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: "breaking value symmetry"
  Abstract: Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. In a recent series of papers, we have studied methods to break value symmetries. Our results identify computational limits on eliminating value symmetry. For instance, we prove that pruning all symmetric values is NP-hard in general. Nevertheless, experiments show that much value symmetry can be broken in practice. These results may be useful to researchers in planning, scheduling and other areas as value symmetry occurs in many different domains.

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"
    - "multiset ordering constraints"
    - "combining symmetry breaking and global 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"
    - "multiset ordering constraints"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"

Connected through hyperedge HE-3 (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"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"
    - "the parameterized complexity of global constraints"

Connected through hyperedge HE-4 (induced by source paper "symmetry within and between solutions"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "symmetry within solutions"
    - "lifshitz topological black holes"
    - "symmetries of symmetry breaking constraints"

Connected through hyperedge HE-5 (induced by source paper "on the complexity and completeness of static constraints for breaking row and column symmetry"):
  with members:
    - "multiset ordering constraints"
    - "the complexity of reasoning with global constraints"
    - "breaking generator 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)