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 linear programming for valued csps a constructive characterization"
  Abstract: A class of valued constraint satisfaction problems (VCSPs) is characterised by a valued constraint language, a fixed set of cost functions on a finite domain. An instance of the problem is specified by a sum of cost functions from the language with the goal to minimise the sum. #R##N#We study which classes of finite-valued languages can be solved exactly by the basic linear programming relaxation (BLP). Thapper and Zivny showed [20] that if BLP solves the language then the language admits a binary commutative fractional polymorphism. We prove that the converse is also true. This leads to a necessary and a sufficient condition which can be checked in polynomial time for a given language. In contrast, the previous necessary and sufficient condition due to [20] involved infinitely many inequalities. #R##N#More recently, Thapper and Zivny [21] showed (using, in particular, a technique introduced in this paper) that core languages that do not satisfy our condition are NP-hard. Taken together, these results imply that a finite-valued language can either be solved using Linear Programming or is NP-hard.

Connected through hyperedge HE-1 (induced by source paper "the complexity of finite valued csps"):
  with members:
    - "an algebraic theory of complexity for discrete optimization"
    - "the complexity of conservative valued csps"
    - "the power of linear programming for general valued csps"
    - "computational complexity of the minimum cost homomorphism problem on three element domains"
    - "tractable triangles and cross free convexity in discrete optimisation"
    - "the power of linear programming for valued csps"
    - "an effective fusion technique of cloud computing and networking series"
    - "tractable optimization problems through hypergraph based structural restrictions"

Connected through hyperedge HE-2 (induced by source paper "complexity of discrete energy minimization problems"):
  with members:
    - "maximum persistency via iterative relaxed inference with graphical models"
    - "a comparative study of modern inference techniques for structured discrete energy minimization problems"
    - "the power of linear programming for valued csps"
    - "efficiently searching for frustrated cycles in map inference"
    - "curvature prior for mrf based segmentation and shape inpainting"
    - "minimizing a sum of submodular functions"
    - "the expressive power of binary submodular functions"

Connected through hyperedge HE-3 (induced by source paper "the complexity of general valued csps"):
  with members:
    - "the power of sherali adams relaxations for general valued csps"
    - "combinatorial optimization algorithms via polymorphisms"
    - "a galois connection for valued constraint languages of infinite size"
    - "algebraic properties of valued constraint satisfaction problem"
    - "effectiveness of structural restrictions for hybrid csps"
    - "local distribution and the symmetry gap approximability of multiway partitioning problems"
    - "sherali adams relaxations for valued csps"
    - "robustly solvable constraint satisfaction problems"

Connected through hyperedge HE-4 (induced by source paper "higher order maximum persistency and comparison theorems"):
  with members:
    - "a new look at reweighted message passing"
    - "maximum persistency via iterative relaxed inference with graphical models"
    - "maximum persistency in energy minimization"
    - "partial optimality by pruning for map inference with general graphical models"
    - "potts model parametric maxflow and k submodular functions"
    - "generalized sequential tree reweighted message passing"
    - "the power of linear programming for valued csps"
    - "efficiently searching for frustrated cycles in map inference"

Connected through hyperedge HE-5 (induced by source paper "a new look at reweighted message passing"):
  with members:
    - "generalized sequential tree reweighted message passing"
    - "efficient mrf energy minimization via adaptive diminishing smoothing"
    - "the power of linear programming for valued csps"
    - "convergent message passing algorithms a unifying view"
    - "tightening lp relaxations for map using message passing"
    - "efficiently searching for frustrated cycles in map inference"
    - "norm product belief propagation primal dual message passing for approximate inference"
    - "lagrangian relaxation for map estimation in graphical models"

Connected through hyperedge HE-6 (induced by source paper "maximum persistency via iterative relaxed inference with graphical models"):
  with members:
    - "higher order maximum persistency and comparison theorems"
    - "a comparative study of modern inference techniques for structured discrete energy minimization problems"
    - "maximum persistency in energy minimization"
    - "partial optimality by pruning for map inference with general graphical models"
    - "potts model parametric maxflow and k submodular functions"
    - "efficient mrf energy minimization via adaptive diminishing smoothing"
    - "getting feasible variable estimates from infeasible ones mrf local polytope study"
    - "generalized roof duality and bisubmodular functions"

Connected through hyperedge HE-7 (induced by source paper "necessary conditions for tractability of valued csps"):
  with members:
    - "algebraic properties of valued constraint satisfaction problem"
    - "a reduction from valued csp to min cost homomorphism problem for digraphs"
    - "the complexity of general valued csps"
    - "the power of linear programming for general valued csps"
    - "computational complexity of the minimum cost homomorphism problem on three element domains"
    - "an effective fusion technique of cloud computing and networking series"
    - "extensions of the minimum cost homomorphism problem"

Connected through hyperedge HE-8 (induced by source paper "half integrality lp branching and fpt algorithms"):
  with members:
    - "towards minimizing k submodular functions"
    - "linear time parameterized algorithms via skew symmetric multicuts"
    - "linear time fpt algorithms via network flow"
    - "the power of linear programming for valued csps"
    - "designing fpt algorithms for cut problems using randomized contractions"
    - "faster parameterized algorithms using linear programming"
    - "min csp on four elements moving beyond submodularity"
    - "on group feedback vertex set parameterized by the size of the cutset"

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)