human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "the power of linear programming for valued csps"):
  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. This framework includes and generalises well-studied constraint satisfaction problems (CSPs) and maximum constraint satisfaction problems (Max-CSPs). Our main result is a precise algebraic characterisation of valued constraint languages whose instances can be solved exactly by the basic linear programming relaxation. Using this result, we obtain tractability of several novel and previously widely-open classes of VCSPs, including problems over valued constraint languages that are: (1) sub modular on arbitrary lattices, (2) bisubmodular (also known as k-sub modular) on arbitrary finite domains, (3) weakly (and hence strongly) tree-sub modular on arbitrary trees.

Includes members:
  Member "an algebraic theory of complexity for discrete optimization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "the complexity of conservative valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "representing fitness landscapes by valued constraints to understand the complexity of local search")
  Member "towards minimizing k submodular functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond boolean surjective vcsps")
  Member "min csp on four elements moving beyond submodularity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "piecewise linear valued csps solvable by linear programming relaxation")
  Member "on the complexity of submodular function minimisation on diamonds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "combinatorial optimization algorithms via polymorphisms")
  Member "hard constraint satisfaction problems have hard gaps at location 1":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of finite valued csps")
  Member "the approximability of max csp with fixed value constraints":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "optimal polynomial time compression for boolean max csp")
  Member "arc consistency for soft constraints":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "tree projections and constraint optimization problems fixed parameter tractability and parallel algorithms")

Question: Please tell me which class the source paper 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)