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: "pseudorandomness and fourier growth bounds for width 3 branching programs"
  Abstract: We present an explicit pseudorandom generator for oblivious, read-once, width-$3$ branching programs, which can read their input bits in any order. The generator has seed length $\tilde{O}( \log^3 n ).$ The previously best known seed length for this model is $n^{1/2+o(1)}$ due to Impagliazzo, Meka, and Zuckerman (FOCS '12). Our work generalizes a recent result of Reingold, Steinke, and Vadhan (RANDOM '13) for \textit{permutation} branching programs. The main technical novelty underlying our generator is a new bound on the Fourier growth of width-3, oblivious, read-once branching programs. Specifically, we show that for any $f:\{0,1\}^n\rightarrow \{0,1\}$ computed by such a branching program, and $k\in [n],$ $$\sum_{s\subseteq [n]: |s|=k} \left| \hat{f}[s] \right| \leq n^2 \cdot (O(\log n))^k,$$ where $\widehat{f}[s] = \mathbb{E}\left[f[U] \cdot (-1)^{s \cdot U}\right]$ is the standard Fourier transform over $\mathbb{Z}_2^n$. The base $O(\log n)$ of the Fourier growth is tight up to a factor of $\log \log n$.

Connected through hyperedge HE-1 (induced by source paper "fourier bounds and pseudorandom generators for product tests"):
  with members:
    - "pseudorandom generators for width 3 branching programs"
    - "pseudorandom generators for read once branching programs in any order"
    - "the coin problem in constant depth sample complexity and parity gates"
    - "pseudorandomness via the discrete fourier transform"
    - "analysis of boolean functions"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "an entropic proof of chang s inequality"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-2 (induced by source paper "coin theorems and the fourier expansion"):
  with members:
    - "fourier bounds and pseudorandom generators for product tests"
    - "the coin problem in constant depth sample complexity and parity gates"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-3 (induced by source paper "pseudorandom generators for width 3 branching programs"):
  with members:
    - "pseudorandom generators for read once branching programs in any order"
    - "pseudorandomness via the discrete fourier transform"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-4 (induced by source paper "pseudorandom generators for read once branching programs in any order"):
  with members:
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-5 (induced by source paper "derandomization beyond connectivity undirected laplacian systems in nearly logarithmic space"):
  with members:
    - "faster algorithms for computing the stationary distribution simulating random walks and more"
    - "almost linear time algorithms for markov chains and new spectral primitives for directed graphs"
    - "efficient inverse maintenance and faster algorithms for linear programming"
    - "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations"
    - "an efficient parallel solver for sdd linear systems"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "efficient accelerated coordinate descent methods and faster algorithms for solving linear systems"
    - "a simple combinatorial algorithm for solving sdd systems in nearly linear time"

Connected through hyperedge HE-6 (induced by source paper "pseudorandom bits for oblivious branching programs"):
  with members:
    - "identity testing for constant width and any order read once oblivious arithmetic branching programs"
    - "identity testing and lower bounds for read k oblivious algebraic branching programs"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"

Connected through hyperedge HE-7 (induced by source paper "identity testing and lower bounds for read k oblivious algebraic branching programs"):
  with members:
    - "some lower bound results for set multilinear arithmetic computations"
    - "subexponential size hitting sets for bounded depth multilinear formulas"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "deterministic identity testing for sum of read once oblivious arithmetic branching programs"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "the limits of depth reduction for arithmetic formulas it s all about the top fan in"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "improved bounds for reduction to depth 4 and depth 3"

Connected through hyperedge HE-8 (induced by source paper "pseudorandomness for read once constant depth circuits"):
  with members:
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "better pseudorandom generators from milder pseudorandom restrictions"

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)