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 "fourier bounds and pseudorandom generators for product tests"):
  Abstract: We study the Fourier spectrum of functions $f\colon \{0,1\}^{mk} \to \{-1,0,1\}$ which can be written as a product of $k$ Boolean functions $f_i$ on disjoint $m$-bit inputs. We prove that for every positive integer $d$, \[ #R##N#\sum_{S \subseteq [mk]: |S|=d} |\hat{f_S}| = O(m)^d . \] Our upper bound is tight up to a constant factor in the $O(\cdot)$. Our proof builds on a new `level-$d$ inequality' that bounds above $\sum_{|S|=d} \hat{f_S}^2$ for any $[0,1]$-valued function $f$ in terms of its expectation, which may be of independent interest. #R##N#As a result, we construct pseudorandom generators for such functions with seed length $\tilde O(m + \log(k/\varepsilon))$, which is optimal up to polynomial factors in $\log m$, $\log\log k$ and $\log\log(1/\varepsilon)$. Our generator in particular works for the well-studied class of combinatorial rectangles, where in addition we allow the bits to be read in any order. Even for this special case, previous generators have an extra $\tilde O(\log(1/\varepsilon))$ factor in their seed lengths. #R##N#Using Schur-convexity, we also extend our results to functions $f_i$ whose range is $[-1,1]$.

Includes members:
  Member "pseudorandom generators for width 3 branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal error pseudodistributions for read once branching programs")
  Member "pseudorandom generators for read once branching programs in any order":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "pseudorandom generators for width 3 branching programs")
  Member "the coin problem in constant depth sample complexity and parity gates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the text ac 0 oplus complexity of andreev s problem")
  Member "pseudorandomness via the discrete fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fast hashing with strong concentration bounds")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "pseudorandomness and fourier growth bounds for width 3 branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coin theorems and the fourier expansion")
  Member "pseudorandomness for regular branching programs via fourier analysis":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "deterministic search for cnf satisfying assignments in almost polynomial time")
  Member "an entropic proof of chang s inequality":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "approximate constraint satisfaction requires large lp relaxations")

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)