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 complexity of general valued csps"
  Abstract: An instance of the Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of labels, and a sum of functions, each function depending on a subset of the variables. Each function can take finite values specifying costs of assignments of labels to its variables or the infinite value, which indicates infeasible assignments. The goal is to find an assignment of labels to the variables that minimizes the sum. #R##N#We study (assuming that P $\ne$ NP) how the complexity of this very general problem depends on the set of functions allowed in the instances, the so-called constraint language. The case when all allowed functions take values in $\{0,\infty\}$ corresponds to ordinary CSPs, where one deals only with the feasibility issue and there is no optimization. This case is the subject of the Algebraic CSP Dichotomy Conjecture predicting for which constraint languages CSPs are tractable and for which NP-hard. The case when all allowed functions take only finite values corresponds to finite-valued CSP, where the feasibility aspect is trivial and one deals only with the optimization issue. The complexity of finite-valued CSPs was fully classified by Thapper and \v{Z}ivn\'y. #R##N#An algebraic necessary condition for tractability of a general-valued CSP with a fixed constraint language was recently given by Kozik and Ochremiak. As our main result, we prove that if a constraint language satisfies this algebraic necessary condition, and the feasibility CSP corresponding to the VCSP with this language is tractable, then the VCSP is tractable. The algorithm is a simple combination of the assumed algorithm for the feasibility CSP and the standard LP relaxation. As a corollary, we obtain that a dichotomy for ordinary CSPs would imply a dichotomy for general-valued CSPs.

Connected through hyperedge HE-1 (induced by source paper "the complexity of boolean surjective general valued csps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of finite valued csps"
    - "a galois connection for weighted relational clones of infinite size"
    - "algebraic properties of valued constraint satisfaction problem"
    - "an algebraic hardness criterion for surjective constraint satisfaction"
    - "an algebraic theory of complexity for discrete optimization"
    - "on the approximation of submodular functions"

Connected through hyperedge HE-2 (induced by source paper "qcsp monsters and the demise of the chen conjecture"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of quantified constraints using the algebraic formulation"
    - "the algebraic dichotomy conjecture for infinite domain constraint satisfaction problems"
    - "quantified constraints and containment problems"
    - "from complexity to algebra and back digraph classes collapsibility and the pgp"
    - "on the complexity of the model checking problem"
    - "meditations on quantified constraint satisfaction"

Connected through hyperedge HE-3 (induced by source paper "toward a dichotomy for approximation of h coloring"):
  with members:
    - "interval like graphs and digraphs"
    - "binarisation for valued constraint satisfaction problems"
    - "towards a characterization of constant factor approximable finite valued csps"
    - "bi arc digraphs and conservative polymorphisms"
    - "local distribution and the symmetry gap approximability of multiway partitioning problems"
    - "conservative constraint satisfaction re revisited"
    - "computational complexity of the minimum cost homomorphism problem on three element domains"
    - "the dichotomy of list homomorphisms for digraphs"

Connected through hyperedge HE-4 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "algebraic properties of valued constraint satisfaction problem"
    - "tropically convex constraint satisfaction"
    - "the power of linear programming for valued csps"
    - "min csp on four elements moving beyond submodularity"
    - "constraint satisfaction tractability from semi lattice operations on infinite sets"

Connected through hyperedge HE-5 (induced by source paper "dichotomy for symmetric boolean pcsps"):
  with members:
    - "algebraic approach to promise constraint satisfaction"
    - "a dichotomy theorem for nonuniform csps"
    - "improved hardness of approximating chromatic number"

Connected through hyperedge HE-6 (induced by source paper "algebraic approach to promise constraint satisfaction"):
  with members:
    - "topology is relevant in a dichotomy conjecture for infinite domain constraint satisfaction problems"
    - "promises make finite constraint satisfaction problems infinitary"
    - "dichotomy for symmetric boolean pcsps"
    - "an algorithmic blend of lps and ring equations for promise csps"
    - "improved inapproximability of rainbow coloring"
    - "super polylogarithmic hypergraph coloring hardness via low degree long codes"
    - "promise constraint satisfaction algebraic structure and a symmetric boolean dichotomy"
    - "a dichotomy theorem for nonuniform csps"

Connected through hyperedge HE-7 (induced by source paper "testing the complexity of a valued csp language"):
  with members:
    - "which np hard sat and csp problems admit exponentially improved algorithms"
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "time complexity of constraint satisfaction via universal algebra"
    - "asking the metaquestions in constraint tractability"
    - "lower bounds for the graph homomorphism problem"
    - "algebraic properties of valued constraint satisfaction problem"

Connected through hyperedge HE-8 (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"
    - "weaker consistency notions for all the csps of bounded width"
    - "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"

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)