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: "weaker consistency notions for all the csps of bounded width"
  Abstract: The characterization of all the Constraint Satisfaction Problems of bounded width, proposed by Feder and Vardi [SICOMP'98], was confirmed in [Bulatov'09] and independently in [FOCS'09, JACM'14]. Both proofs are based on the (2,3)-consistency (using Prague consistency in [FOCS'09], directly in [Bulatov'09]) which is costly to verify. #R##N#We introduce a new consistency notion, Singleton Linear Arc Consistency (SLAC), and show that it solves the same family of problems. SLAC is weaker than Singleton Arc Consistency (SAC) and thus the result answers the question from [JLC'13] by showing that SAC solves all the problems of bounded width. At the same time the problem of verifying weaker consistency (even SAC) offers significant computational advantages over the problem of verifying (2,3)-consistency which improves the algorithms solving the CSPs of bounded width.

Connected through hyperedge HE-1 (induced by source paper "a polynomial time algorithm for median closed semilinear constraints"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of general valued csps"
    - "tropically convex constraint satisfaction"
    - "constraint satisfaction and semilinear expansions of addition over the rationals and the reals"
    - "essential convexity and complexity of semi algebraic constraints"
    - "arc consistency and friends"

Connected through hyperedge HE-2 (induced by source paper "exploring directional path consistency for solving constraint networks"):
  with members:
    - "arc consistency and friends"

Connected through hyperedge HE-3 (induced by source paper "the proof of csp dichotomy conjecture"):
  with members:
    - "algebraic approach to promise constraint satisfaction"
    - "a modifiction of the csp algorithm for infinite languages"
    - "a dichotomy theorem for nonuniform csps"
    - "the complexity of quantified constraints using the algebraic formulation"
    - "the algebraic dichotomy conjecture for infinite domain constraint satisfaction problems"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "complexity classification in infinite domain constraint satisfaction"
    - "absorbing subalgebras cyclic terms and the constraint satisfaction problem"

Connected through hyperedge HE-4 (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"
    - "the power of arc consistency for csps defined by partially ordered forbidden patterns"
    - "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"

Connected through hyperedge HE-5 (induced by source paper "a dichotomy theorem for nonuniform csps"):
  with members:
    - "constraint satisfaction problems over semilattice block mal tsev algebras"
    - "asking the metaquestions in constraint tractability"
    - "graphs of finite algebras edges and connectivity"
    - "conservative constraint satisfaction re revisited"
    - "absorbing subalgebras cyclic terms and the constraint satisfaction problem"
    - "a characterisation of first order constraint satisfaction problems"

Connected through hyperedge HE-6 (induced by source paper "constraint satisfaction problem dichotomy for finite templates a proof via consistency checks"):
  with members:
    - "space complexity of list h colouring a dichotomy"
    - "definability of linear equation systems over groups and rings"

Connected through hyperedge HE-7 (induced by source paper "robust algorithms with polynomial loss for near unanimity csps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of general valued csps"
    - "n permutability and linear datalog implies symmetric datalog"
    - "on the usefulness of predicates"

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)