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: "the complexity of reasoning with global constraints"
  Abstract: Constraint propagation is one of the techniques central to the success of constraint programming. To reduce search, fast algorithms associated with each constraint prune the domains of variables. With global (or non-binary) constraints, the cost of such propagation may be much greater than the quadratic cost for binary constraints. We therefore study the computational complexity of reasoning with global constraints. We first characterise a number of important questions related to constraint propagation. We show that such questions are intractable in general, and identify dependencies between the tractability and intractability of the different questions. We then demonstrate how the tools of computational complexity can be used in the design and analysis of specific global constraints. In particular, we illustrate how computational complexity can be used to determine when a lesser level of local consistency should be enforced, when constraints can be safely generalized, when decomposing constraints will reduce the amount of pruning, and when combining constraints is tractable.

Connected through hyperedge HE-1 (induced by source paper "distributed constraint problems for utilitarian agents with privacy concerns recast as pomdps"):
  with members:
    - "bnb adopt an asynchronous branch and bound dcop algorithm"
    - "stochastic constraint programming"
    - "asynchronous partial overlay a new algorithm for solving distributed constraint satisfaction problems"

Connected through hyperedge HE-2 (induced by source paper "structural decompositions for problems with global constraints"):
  with members:
    - "size bounds and query plans for relational joins"
    - "constraint solving via fractional edge covers"
    - "tractable combinations of global constraints"
    - "tractable optimization problems through hypergraph based structural restrictions"
    - "backdoors to satisfaction"
    - "decomposition of the nvalue constraint"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"
    - "hypertree decompositions and tractable queries"

Connected through hyperedge HE-3 (induced by source paper "lifting structural tractability to csp with global constraints"):
  with members:
    - "constraint solving via fractional edge covers"
    - "backdoors to satisfaction"
    - "decomposition of the nvalue constraint"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"
    - "hypertree decompositions and tractable queries"

Connected through hyperedge HE-4 (induced by source paper "global preferential consistency for the topological sorting based maximal spanning tree problem"):
  with members:
    - "a constraint satisfaction approach to the robust spanning tree problem with interval data"

Connected through hyperedge HE-5 (induced by source paper "decomposition of the nvalue constraint"):
  with members:
    - "circuit complexity and decompositions of global constraints"
    - "decompositions of all different global cardinality and related constraints"
    - "slide a useful special case of the cardpath constraint"
    - "the parameterized complexity of global constraints"

Connected through hyperedge HE-6 (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"
    - "breaking generator symmetry"

Connected through hyperedge HE-7 (induced by source paper "propagating conjunctions of alldifferent constraints"):
  with members:
    - "decompositions of all different global cardinality and related constraints"
    - "the parameterized complexity of global constraints"

Connected through hyperedge HE-8 (induced by source paper "circuit complexity and decompositions of global constraints"):
  with members:
    - "decompositions of all different global cardinality and related constraints"
    - "slide a useful special case of the cardpath constraint"
    - "decompositions of grammar constraints"
    - "the weighted cfg constraint"
    - "a knowledge compilation map"

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)