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 generator symmetry"
  Abstract: Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where breaking just the symmetries in a generating set is complete, there are also cases where no irredundant generating set eliminates all symmetry. However, focusing on just generators improves tractability. We prove that it is polynomial in the size of the generating set to eliminate all symmetric solutions, but NP-hard to prune all symmetric values. Our proof considers row and column symmetry, a common type of symmetry in matrix models where breaking just generator symmetries is very effective. We show that propagating a conjunction of lexicographical ordering constraints on the rows and columns of a matrix of decision variables is NP-hard.

Connected through hyperedge HE-1 (induced by source paper "symmetry breaking for distributed multi context systems"):
  with members:
    - "symmetry breaking answer set solving"

Connected through hyperedge HE-2 (induced by source paper "symmetry breaking for answer set programming"):
  with members:
    - "practical graph isomorphism ii"
    - "symmetry breaking answer set solving"
    - "a translational approach to constraint answer set solving"
    - "heuristics in conflict resolution"
    - "the dlv system for knowledge representation and reasoning"
    - "tight logic programs"
    - "bounded ltl model checking with stable models"

Connected through hyperedge HE-3 (induced by source paper "symmetry breaking answer set solving"):
  with members:
    - "practical graph isomorphism ii"
    - "a translational approach to constraint answer set solving"
    - "the dlv system for knowledge representation and reasoning"
    - "weight constraints as nested expressions"
    - "tight logic programs"
    - "bounded ltl model checking with stable models"

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