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 power of arc consistency for csps defined by partially ordered forbidden patterns"
  Abstract: Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial intelligence. Forbidding patterns (generic sub-instances) provides a means of defining CSP fragments which are neither exclusively language-based nor exclusively structure-based. It is known that the class of binary CSP instances in which the broken-triangle pattern (BTP) does not occur, a class which includes all tree-structured instances, are decided by arc consistency (AC), a ubiquitous reduction operation in constraint solvers. We provide a characterisation of simple partially-ordered forbidden patterns which have this AC-solvability property. It turns out that BTP is just one of five such AC-solvable patterns. The four other patterns allow us to exhibit new tractable classes.

Connected through hyperedge HE-1 (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"
    - "variable and value elimination in binary constraint satisfaction via forbidden patterns"
    - "the tractability of csp classes defined by 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-2 (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"
    - "variable and value elimination in binary constraint satisfaction via forbidden patterns"
    - "the tractability of csp classes defined by forbidden patterns"
    - "arc consistency and friends"
    - "hybrid tractability of valued constraint problems"
    - "tractable hypergraph properties for constraint satisfaction and conjunctive queries"

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.CC(Computational Complexity)