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: "on the complexity and completeness of static constraints for breaking row and column symmetry"
  Abstract: We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove that we can compute in polynomial time a unique representative of an equivalence class in a matrix model with row and column symmetry if the number of rows (or of columns) is bounded and in a number of other special cases. On the negative side, we show that whilst DOUBLELEX and SNAKELEX are often effective in practice, they can leave a large number of symmetric solutions in the worst case. In addition, we prove that propagating DOUBLELEX completely is NP-hard. Finally we consider how to break row, column and value symmetry, correcting a result in the literature about the safeness of combining different symmetry breaking constraints. We end with the first experimental study on how much symmetry is left by DOUBLELEX and SNAKELEX on some benchmark problems.

Connected through hyperedge HE-1 (induced by source paper "a commentary on breaking row and column symmetries in matrix models"):
  with members:
    - "breaking symmetry with different orderings"
    - "multiset ordering constraints"
    - "filtering algorithms for the multiset ordering constraint"
    - "slide a useful special case of the cardpath constraint"

Connected through hyperedge HE-2 (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"
    - "symmetry breaking constraints recent results"
    - "graph symmetry detection and canonical labeling differences and synergies"

Connected through hyperedge HE-3 (induced by source paper "breaking symmetry with different orderings"):
  with members:
    - "breaking value symmetry"
    - "multiset ordering constraints"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"

Connected through hyperedge HE-4 (induced by source paper "symmetry breaking constraints recent results"):
  with members:
    - "the alldifferent constraint with precedences"
    - "breaking value symmetry"
    - "multiset ordering constraints"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"

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

Connected through hyperedge HE-6 (induced by source paper "parameterized complexity results in symmetry breaking"):
  with members:
    - "symmetry within and between solutions"
    - "breaking value symmetry"
    - "combining symmetry breaking and global constraints"
    - "symmetries of symmetry breaking constraints"
    - "the parameterized complexity of global constraints"

Connected through hyperedge HE-7 (induced by source paper "symmetry within and between solutions"):
  with members:
    - "symmetry within solutions"
    - "breaking value symmetry"
    - "lifshitz topological black holes"
    - "symmetries of symmetry breaking 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)