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: "spectral norm of symmetric functions"
  Abstract: The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning theory, circuit complexity, and communication complexity. In this paper, we give a combinatorial characterization for the spectral norm of symmetric functions. We show that the logarithm of the spectral norm is of the same order of magnitude as $r(f)\log(n/r(f))$ where $r(f) = \max\{r_0,r_1\}$, and $r_0$ and $r_1$ are the smallest integers less than $n/2$ such that $f(x)$ or $f(x) \cdot parity(x)$ is constant for all $x$ with $\sum x_i \in [r_0, n-r_1]$. We mention some applications to the decision tree and communication complexity of symmetric functions.

Connected through hyperedge HE-1 (induced by source paper "near log convexity of measured heat in discrete time and consequences"):
  with members:
    - "on the communication complexity of sparse set disjointness and exists equal problems"
    - "the non adaptive query complexity of testing k parities"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-2 (induced by source paper "dual polynomials and communication complexity of textsf xor functions"):
  with members:
    - "a nearly optimal lower bound on the approximate degree of ac 0"

Connected through hyperedge HE-3 (induced by source paper "fourier sparsity of gf 2 polynomials"):
  with members:
    - "communication is bounded by root of rank"
    - "on the structure of boolean functions with small spectral norm"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-4 (induced by source paper "pseudorandomness and fourier growth bounds for width 3 branching programs"):
  with members:
    - "fourier sparsity spectral norm and the log rank conjecture"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "on the structure of boolean functions with small spectral norm"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-5 (induced by source paper "fourier sparsity spectral norm and the log rank conjecture"):
  with members:
    - "an entropic proof of chang s inequality"
    - "tight bounds on communication complexity of symmetric xor functions in one way and smp models"
    - "on the parity complexity measures of boolean functions"
    - "on the communication complexity of xor functions"

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)