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: "algebraic properties of valued constraint satisfaction problem"
  Abstract: The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP 2005].

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"
    - "the complexity of general valued csps"
    - "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 "piecewise linear valued csps solvable by linear programming relaxation"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "the complexity of general valued csps"
    - "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-3 (induced by source paper "beyond boolean surjective vcsps"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "towards minimizing k submodular functions"
    - "the complexity of surjective homomorphism problems a survey"
    - "the complexity of global cardinality constraints"

Connected through hyperedge HE-4 (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"
    - "the complexity of general valued csps"

Connected through hyperedge HE-5 (induced by source paper "on planar valued csps"):
  with members:
    - "the power of sherali adams relaxations for general valued csps"
    - "even delta matroids and the complexity of planar boolean csps"
    - "the complexity of finite valued csps"
    - "a galois connection for weighted relational clones of infinite size"
    - "necessary conditions for tractability of valued csps"
    - "hybrid v csps and algebraic reductions"
    - "the complexity of general valued csps"
    - "effectiveness of structural restrictions for hybrid csps"

Connected through hyperedge HE-6 (induced by source paper "binarisation for valued constraint satisfaction problems"):
  with members:
    - "the power of sherali adams relaxations for general valued csps"
    - "a galois connection for weighted relational clones of infinite size"
    - "a finer reduction of constraint problems to digraphs"
    - "a reduction from valued csp to min cost homomorphism problem for digraphs"
    - "the complexity of general valued csps"
    - "sherali adams relaxations for valued csps"
    - "robustly solvable constraint satisfaction problems"
    - "an algebraic theory of complexity for discrete optimization"

Connected through hyperedge HE-7 (induced by source paper "the power of sherali adams relaxations for general valued csps"):
  with members:
    - "binarisation for valued constraint satisfaction problems"
    - "a reduction from valued csp to min cost homomorphism problem for digraphs"
    - "the complexity of general valued csps"
    - "local distribution and the symmetry gap approximability of multiway partitioning problems"
    - "robustly solvable constraint satisfaction problems"
    - "sum of squares proofs and the quest toward optimal algorithms"
    - "half integrality lp branching and fpt algorithms"
    - "approximate constraint satisfaction requires large lp relaxations"

Connected through hyperedge HE-8 (induced by source paper "the complexity of general valued csps seen from the other side"):
  with members:
    - "a dichotomy theorem for nonuniform csps"
    - "the proof of csp dichotomy conjecture"
    - "extended formulation for csp that is compact for instances of bounded treewidth"
    - "the complexity of general valued csps"
    - "a trichotomy in the complexity of counting answers to conjunctive queries"
    - "the power of linear programming for valued csps"
    - "tractable optimization problems through hypergraph based structural restrictions"
    - "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)