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: "flow based propagators for the sequence and related global constraints"
  Abstract: We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE constraint in $O(n^2)$ time down a branch of the search tree. This improves upon the best existing domain consistency algorithm by a factor of $O(\log n)$. The flows used in these algorithms are derived from a linear program. Some of them differ from the flows used to propagate global constraints like GCC since the domains of the variables are encoded as costs on the edges rather than capacities. Such flows are efficient for maintaining bounds consistency over large domains and may be useful for other global constraints.

Connected through hyperedge HE-1 (induced by source paper "classifying pattern and feature properties to get a θ n checker and reformulation for sliding time series constraints"):
  with members:
    - "augmenting stream constraint programming with eventuality conditions"
    - "global constraint catalog volume ii time series constraints"
    - "slide a useful special case of the cardpath constraint"

Connected through hyperedge HE-2 (induced by source paper "contractibility for open global constraints"):
  with members:
    - "decompositions of all different global cardinality and related constraints"
    - "the soft cumulative constraint"
    - "slide a useful special case of the cardpath constraint"
    - "decision problems for convex languages"

Connected through hyperedge HE-3 (induced by source paper "conjunctions of among constraints"):
  with members:
    - "propagating conjunctions of alldifferent constraints"
    - "slide a useful special case of the cardpath constraint"
    - "range and roots two common patterns for specifying and propagating counting and occurrence constraints"

Connected through hyperedge HE-4 (induced by source paper "the regulargcc matrix constraint"):
  with members:
    - "on the complexity and completeness of static constraints for breaking row and column symmetry"
    - "slide a useful special case of the cardpath constraint"
    - "restricted global grammar constraints"
    - "combining symmetry breaking and global constraints"

Connected through hyperedge HE-5 (induced by source paper "consistency techniques for flow based projection safe global cost functions in weighted constraint satisfaction"):
  with members:
    - "bounds arc consistency for weighted csps"
    - "arc consistency for soft 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)