human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "parameterized complexity results in symmetry breaking"):
  Abstract: Symmetry is a common feature of many combinatorial problems. Unfortunately eliminating all symmetry from a problem is often computationally intractable. This paper argues that recent parameterized complexity results provide insight into that intractability and help identify special cases in which symmetry can be dealt with more tractably.

Includes members:
  Member "on the complexity and completeness of static constraints for breaking row and column symmetry":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a commentary on breaking row and column symmetries in matrix models")
  Member "symmetry within and between solutions":
    also connected through other hyperedges:
      (none)
  Member "breaking value symmetry":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "breaking symmetry with different orderings")
  Member "combining symmetry breaking and global constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "breaking symmetry with different orderings")
  Member "symmetries of symmetry breaking constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "breaking symmetry with different orderings")
  Member "the parameterized complexity of global constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "parameterized algorithms for the matrix completion problem")

Question: Please tell me which class the source paper 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)