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 tractability of csp classes defined by forbidden patterns"
  Abstract: The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions on the hypergraph of constraint scopes) and relational properties (restrictions on the language of constraint relations). Recently, some authors have considered hybrid properties that restrict the constraint hypergraph and the relations simultaneously.#R##N##R##N#Our key contribution is the novel concept of a CSP pattern and classes of problems defined by forbidden patterns (which can be viewed as forbidding generic sub-problems). We describe the theoretical framework which can be used to reason about classes of problems defined by forbidden patterns. We show that this framework generalises certain known hybrid tractable classes.#R##N##R##N#Although we are not close to obtaining a complete characterisation concerning the tractability of general forbidden patterns, we prove a dichotomy in a special case: classes of problems that arise when we can only forbid binary negative patterns (generic subproblems in which only disallowed tuples are specified). In this case we show that all (finite sets of) forbidden patterns define either polynomial-time solvable or NP-complete classes of instances.

Connected through hyperedge HE-1 (induced by source paper "testing unsatisfiability of constraint satisfaction problems via tensor products"):
  with members:
    - "a dichotomy theorem for nonuniform csps"

Connected through hyperedge HE-2 (induced by source paper "binary constraint satisfaction problems defined by excluded topological minors"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the power of arc consistency for csps defined by partially ordered forbidden patterns"
    - "variable and value elimination in binary constraint satisfaction via forbidden patterns"
    - "hybrid tractability of valued constraint problems"
    - "finding topological subgraphs is fixed parameter tractable"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-3 (induced by source paper "on singleton arc consistency for csps defined by monotone patterns"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "weaker consistency notions for all the csps of bounded width"
    - "the power of arc consistency for csps defined by partially ordered forbidden patterns"
    - "variable and value elimination in binary constraint satisfaction via forbidden patterns"
    - "arc consistency and friends"
    - "hybrid tractability of valued constraint problems"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

Connected through hyperedge HE-4 (induced by source paper "backdoors into heterogeneous classes of sat and csp"):
  with members:
    - "combining treewidth and backdoors for csp"
    - "discovering archipelagos of tractability for constraint satisfaction and counting"
    - "solving problems on graphs of high rank width"
    - "meta kernelization using well structured modulators"
    - "on backdoors to tractable constraint languages"
    - "backdoors to abduction"
    - "strong backdoors to bounded treewidth sat"
    - "backdoors to satisfaction"

Connected through hyperedge HE-5 (induced by source paper "variable and value elimination in binary constraint satisfaction via forbidden patterns"):
  with members:
    - "a dichotomy for 2 constraint forbidden csp patterns"
    - "tractable triangles and cross free convexity in discrete optimisation"
    - "hybrid tractable classes of binary quantified constraint satisfaction problems"
    - "conflict directed backjumping revisited"

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)