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 complexity of planar boolean csp with complex weights"):
  Abstract: We prove a complexity dichotomy theorem for symmetric complex-weighted Boolean #CSP when the constraint graph of the input must be planar. The problems that are #P-hard over general graphs but tractable over planar graphs are precisely those with a holographic reduction to matchgates. This generalizes a theorem of Cai, Lu, and Xia for the case of real weights. We also obtain a dichotomy theorem for a symmetric arity 4 signature with complex weights in the planar Holant framework, which we use in the proof of our #CSP dichotomy. In particular, we reduce the problem of evaluating the Tutte polynomial of a planar graph at the point (3,3) to counting the number of Eulerian orientations over planar 4-regular graphs to show the latter is #P-hard. This strengthens a theorem by Huang and Lu to the planar setting. Our proof techniques combine new ideas with refinements and extensions of existing techniques. These include planar pairings, the recursive unary construction, the anti-gadget technique, and pinning in the Hadamard basis.

Includes members:
  Member "a complete dichotomy rises from the capture of vanishing signatures":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "gadgets and anti gadgets leading to a complexity dichotomy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a holant dichotomy is the fkt algorithm universal")
  Member "holant problems for regular graphs with complex edge functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the complexity of counting edge colorings and a dichotomy for some higher domain holant problems")
  Member "the complexity of partition functions on hermitian matrices":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")
  Member "graph homomorphisms with complex values a dichotomy theorem":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")
  Member "the complexity of weighted boolean csp":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "complexity of counting weighted eulerian orientations with ars")
  Member "the complexity of weighted boolean csp with mixed signs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the complexity of holant problems over boolean domain with non negative weights")
  Member "a complexity dichotomy for partition functions with mixed signs":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a dichotomy for bounded degree graph homomorphisms with nonnegative weights")

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)