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 "a reduction from valued csp to min cost homomorphism problem for digraphs"):
  Abstract: In a valued constraint satisfaction problem (VCSP), the goal is to find an assignment of labels to variables that minimizes a given sum of functions. Each function in the sum depends on a subset of variables, takes values which are rational numbers or infinity, and is chosen from a fixed finite set of functions called a constraint language. The case when all functions take only values 0 and infinity is known as the constraint satisfaction problem (CSP). It is known that any CSP with fixed constraint language is polynomial-time equivalent to one where the constraint language contains a single binary relation (i.e. a digraph). A recent proof of this by Bulin et al. gives such a reduction that preserves most of the algebraic properties of the constraint language that are known to characterize the complexity of the corresponding CSP. We adapt this proof to the more general setting of VCSP to show that each VCSP with a fixed finite (valued) constraint language is equivalent to one where the constraint language consists of one $\{0,\infty\}$-valued binary function (i.e. a digraph) and one finite-valued unary function, the latter problem known as the (extended) Minimum Cost Homomorphism Problem for digraphs. We also show that our reduction preserves some important algebraic properties of the (valued) constraint language.

Includes members:
  Member "a finer reduction of constraint problems to digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binarisation for valued constraint satisfaction problems")
  Member "algebraic properties of valued constraint satisfaction problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "the complexity of general valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "an algebraic theory of complexity for discrete optimization":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "on the reduction of the csp dichotomy conjecture to digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a finer reduction of constraint problems to digraphs")
  Member "computational complexity of the minimum cost homomorphism problem on three element domains":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "toward a dichotomy for approximation of h coloring")
  Member "extensions of the minimum cost homomorphism problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "binarisation for valued constraint satisfaction problems")

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)