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: "towards a characterization of constant factor approximable finite valued csps"
  Abstract: In this paper we study the approximability of (Finite-)Valued Constraint Satisfaction Problems (VCSPs) with a fixed finite constraint language {\Gamma} consisting of finitary functions on a fixed finite domain. An instance of VCSP is given by a finite set of variables and a sum of functions belonging to {\Gamma} and depending on a subset of the variables. Each function takes values in [0, 1] specifying costs of assignments of labels to its variables, and the goal is to find an assignment of labels to the variables that minimizes the sum. A recent result of Ene et al. says that, under the mild technical condition that {\Gamma} contains the equality relation, the basic LP relaxation is optimal for constant-factor approximation for VCSP({\Gamma}) unless the Unique Games Conjecture fails. Using the algebraic approach to the CSP, we give new natural algebraic conditions for the finiteness of the integrality gap for the basic LP relaxation of VCSP({\Gamma}). We also show how these algebraic conditions can in principle be used to round solutions of the basic LP relaxation, and how, for several examples that cover all previously known cases, this leads to efficient constant-factor approximation algorithms. Finally, we show that the absence of another algebraic condition leads to NP-hardness of constant-factor approximation.

Connected through hyperedge HE-1 (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"
    - "bi arc digraphs and conservative polymorphisms"
    - "the complexity of general valued csps"
    - "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-2 (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"

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)