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 "necessary conditions for tractability of valued csps"):
  Abstract: The connection between constraint languages and clone theory has been a fruitful line of research on the complexity of constraint satisfaction problems. In a recent result, Cohen et al. [SIAM J. Comput., 42 (2013), pp. 915--1939] have characterized a Galois connection between valued constraint languages and so-called weighted clones. In this paper, we study the structure of weighted clones. We extend the results of Creed and Živný from [Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming, 2011, pp. 210--224] on types of weightings necessarily contained in every nontrivial weighted clone. This result has immediate computational complexity consequences as it provides necessary conditions for tractability of weighted clones and thus valued constraint languages. We demonstrate that some of the necessary conditions are also sufficient for tractability, while others are provably not.

Includes members:
  Member "algebraic properties of valued constraint satisfaction problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the complexity of boolean surjective general valued csps")
  Member "a reduction from valued csp to min cost homomorphism problem for digraphs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "binarisation for valued constraint satisfaction problems")
  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 "the power of linear programming for general valued csps":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "graphical models and belief propagation hierarchy for physics constrained network flows")
  Member "computational complexity of the minimum cost homomorphism problem on three element domains":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "toward a dichotomy for approximation of h coloring")
  Member "an effective fusion technique of cloud computing and networking series":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "binarisation for valued constraint satisfaction problems")
  Member "the power of linear programming for valued csps a constructive characterization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of finite valued csps")
  Member "extensions of the minimum cost homomorphism problem":
    also connected through other hyperedges:
      - Hyperedge HE-8 (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)