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 "constant unary constraints and symmetric real weighted counting constraint satisfaction problems"):
  Abstract: A unary constraint (on the Boolean domain) is a function from {0,1} to the set of real numbers. A free use of auxiliary unary constraints given besides input instances has proven to be useful in establishing a complete classification of the computational complexity of approximately solving weighted counting Boolean constraint satisfaction problems (or #CSPs). In particular, two special constant unary constraints are a key to an arity reduction of arbitrary constraints, sufficient for the desired classification. In an exact counting model, both constant unary constraints are always assumed to be available since they can be eliminated efficiently using an arbitrary nonempty set of constraints. In contrast, we demonstrate, in an approximate counting model, that at least one of them is efficiently approximated and thus eliminated approximately by a nonempty constraint set. This fact directly leads to an efficient construction of polynomial-time randomized approximation-preserving Turing reductions (or AP-reductions) from #CSPs with designated constraints to any given #CSPs composed of symmetric real-valued constraints of arbitrary arities even in the presence of arbitrary extra unary constraints.

Includes members:
  Member "optimization randomized approximability and boolean constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "uniform circuit and logarithmic space approximations of refined combinatorial optimization problems")
  Member "approximation complexity of complex weighted degree two counting constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "holant clones and the approximability of conservative holant problems")
  Member "approximate counting for complex weighted boolean constraint satisfaction problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "holant clones and the approximability of conservative holant problems")
  Member "the complexity of weighted boolean csp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "complexity of counting weighted eulerian orientations with ars")
  Member "a complexity dichotomy for partition functions with mixed signs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")
  Member "an approximation trichotomy for boolean csp":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lower bounds for testing graphical models colorings and antiferromagnetic ising models")

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)