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 "xcsp3 an integrated format for benchmarking combinatorial constrained problems"):
  Abstract: We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost functions, reification, views, annotations, variable quantification, distributed, probabilistic and qualitative reasoning. The new format is made compact, highly readable, and rather easy to parse. Interestingly, it captures the structure of the problem models, through the possibilities of declaring arrays of variables, and identifying syntactic and semantic groups of constraints. The number of constraints is kept under control by introducing a limited set of basic constraint forms, and producing almost automatically some of their variations through lifting, restriction, sliding, logical combination and relaxation mechanisms. As a result, XCSP3 encompasses practically all constraints that can be found in major constraint solvers developed by the CP community. A website, which is developed conjointly with the format, contains many models and series of instances. The user can make sophisticated queries for selecting instances from very precise criteria. The objective of XCSP3 is to ease the effort required to test and compare different algorithms by providing a common test-bed of combinatorial constrained instances.

Includes members:
  Member "short and long supports for constraint propagation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "lazy model expansion interleaving grounding with search")
  Member "the seqbin constraint revisited":
    also connected through other hyperedges:
      (none)
  Member "stochastic constraint programming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compiling stochastic constraint programs to and or decision diagrams")
  Member "slide a useful special case of the cardpath constraint":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a commentary on breaking row and column symmetries in matrix models")
  Member "decompositions of grammar constraints":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "circuit complexity and decompositions of global constraints")
  Member "finite domain bounds consistency revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the bin_counts constraint filtering and applications")
  Member "the alldifferent constraint a survey":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "boolean equi propagation for concise and efficient sat encodings of combinatorial problems")

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)