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: "on minimal constraint networks"
  Abstract: In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter conjectured this computation problem to be NP-hard. We prove this conjecture. We also prove a conjecture by Dechter and Pearl stating that for k\geq2 it is NP-hard to decide whether a single constraint can be decomposed into an equivalent k-ary constraint network. We show that this holds even in case of bi-valued constraints where k\geq3, which proves another conjecture of Dechter and Pearl. Finally, we establish the tractability frontier for this problem with respect to the domain cardinality and the parameter k.

Connected through hyperedge HE-1 (induced by source paper "on equivalence and cores for incomplete databases in open and closed worlds"):
  with members:
    - "answering non monotonic queries in relational data exchange"

Connected through hyperedge HE-2 (induced by source paper "all or nothing toward a promise problem dichotomy for constraint problems"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "gap theorems for robust satisfiability boolean csps and beyond"
    - "asking the metaquestions in constraint tractability"

Connected through hyperedge HE-3 (induced by source paper "aggregation and ordering in factorised databases"):
  with members:
    - "constraint solving via fractional edge covers"
    - "fdb a query engine for factorised relational databases"
    - "the case for rodentstore an adaptive declarative storage system"
    - "world set decompositions expressiveness and efficient algorithms"

Connected through hyperedge HE-4 (induced by source paper "the parameterized complexity of reasoning problems beyond np"):
  with members:
    - "backdoors to normality for disjunctive logic programs"
    - "backdoors to abduction"
    - "unfolding partiality and disjunctions in stable model semantics"
    - "stable models and an alternative logic programming paradigm"

Connected through hyperedge HE-5 (induced by source paper "fdb a query engine for factorised relational databases"):
  with members:
    - "constraint solving via fractional edge covers"
    - "world set decompositions expressiveness and efficient algorithms"

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)