human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on tractable exponential sums"
  Abstract: We consider the problem of evaluating certain exponential sums. These sums take the form Σx1,x2,...,xn∈ZN e2πi/N f(x1,x2,...,xn), where each xi is summed over a ring ZN, and f(x1,x2,...,xn) is a multivariate polynomial with integer coefficients. We show that the sum can be evaluated in polynomial time in n and log N when f is a quadratic polynomial. This is true even when the factorization of N is unknown. Previously, this was known for a prime modulus N. On the other hand, for very specific families of polynomials of degree ≥ 3 we show the problem is #P-hard, even for any fixed prime or prime power modulus. This leads to a complexity dichotomy theorem -- a complete classification of each problem to be either computable in polynomial time or #P-hard -- for a class of exponential sums. These sums arise in the classifications of graph homomorphisms and some other counting CSP type problems, and these results lead to complexity dichotomy theorems. For the polynomial-time algorithm, Gauss sums form the basic building blocks; for the hardness result we prove group-theoretic necessary conditions for tractability.

Connected through hyperedge HE-1 (induced by source paper "stabilizer circuits quadratic forms and computing matrix rank"):
  with members:
    - "symmetric indefinite triangular factorization revealing the rank profile matrix"
    - "simulation of quantum circuits via stabilizer frames"
    - "powers of tensors and fast matrix multiplication"
    - "fast matrix rank algorithms and applications"

Connected through hyperedge HE-2 (induced by source paper "complexity classification of the eight vertex model"):
  with members:
    - "holographic algorithm with matchgates is universal for planar csp over boolean domain"
    - "the complexity of holant problems over boolean domain with non negative weights"
    - "approximating the partition function of the ferromagnetic potts model"
    - "graph homomorphisms with complex values a dichotomy theorem"
    - "a complexity dichotomy for partition functions with mixed signs"

Connected through hyperedge HE-3 (induced by source paper "holographic algorithm with matchgates is universal for planar csp over boolean domain"):
  with members:
    - "a holant dichotomy is the fkt algorithm universal"
    - "the complexity of counting edge colorings and a dichotomy for some higher domain holant problems"
    - "the complexity of planar boolean csp with complex weights"
    - "holographic algorithms without matchgates"
    - "the complexity of weighted boolean csp"
    - "the complexity of weighted boolean csp with mixed signs"

Connected through hyperedge HE-4 (induced by source paper "a holant dichotomy is the fkt algorithm universal"):
  with members:
    - "holographic algorithms beyond matchgates"
    - "the complexity of planar boolean csp with complex weights"
    - "gadgets and anti gadgets leading to a complexity dichotomy"
    - "holographic algorithms without matchgates"

Connected through hyperedge HE-5 (induced by source paper "the complexity of counting edge colorings and a dichotomy for some higher domain holant problems"):
  with members:
    - "the complexity of planar boolean csp with complex weights"
    - "dichotomy for holant problems with a function on domain size 3"
    - "complexity of counting csp with complex weights"
    - "gadgets and anti gadgets leading to a complexity dichotomy"
    - "holant problems for regular graphs with complex edge functions"
    - "from holant to csp and back dichotomy for holant c problems"
    - "graph homomorphisms with complex values a dichotomy theorem"
    - "the complexity of weighted boolean csp"

Connected through hyperedge HE-6 (induced by source paper "complexity of counting csp with complex weights"):
  with members:
    - "the complexity of weighted and unweighted csp"
    - "an effective dichotomy for the counting constraint satisfaction problem"
    - "non negative weighted csps an effective complexity dichotomy"
    - "a decidable dichotomy theorem on directed graph homomorphisms with non negative weights"
    - "the complexity of partition functions on hermitian matrices"
    - "graph homomorphisms with complex values a dichotomy theorem"
    - "a complexity dichotomy for partition functions with mixed signs"

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