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 for regular branching programs via fourier analysis"
  Abstract: We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of $s^{1/2+o(1)}$ for arbitrary branching programs of size $s$). Our techniques also give seed length $n^{1/2+o(1)}$ for general oblivious, read-once branching programs of width $2^{n^{o(1)}}$, which is incomparable to the results of Impagliazzo et al.Our pseudorandom generator is similar to the one used by Gopalan et al. (FOCS 2012) for read-once CNFs, but the analysis is quite different; ours is based on Fourier analysis of branching programs. In particular, we show that an oblivious, read-once, regular branching program of width $w$ has Fourier mass at most $(2w^2)^k$ at level $k$, independent of the length of the program.

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 and fourier growth bounds for width 3 branching programs"
    - "an entropic proof of chang s inequality"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-2 (induced by source paper "deterministic search for cnf satisfying assignments in almost polynomial time"):
  with members:
    - "on polynomial approximations to ac 0"
    - "efficient deterministic approximate counting for low degree polynomial threshold functions"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "fooling functions of halfspaces under product distributions"
    - "bounded independence fools halfspaces"
    - "pseudorandom generators for polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-3 (induced by source paper "improved pseudorandom generators from pseudorandom multi switching lemmas"):
  with members:
    - "on polynomial approximations to ac 0"
    - "near optimal small depth lower bounds for small distance connectivity"
    - "an average case depth hierarchy theorem for boolean circuits"
    - "the average sensitivity of bounded depth formulas"
    - "a counterexample to the generalized linial nisan conjecture"

Connected through hyperedge HE-4 (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 and fourier growth bounds for width 3 branching programs"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-5 (induced by source paper "non malleable codes for small depth circuits"):
  with members:
    - "improved non malleable extractors non malleable codes and independent source extractors"
    - "non malleable extractors and codes with their many tampered extensions"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "non malleable extractors two source extractors and privacy amplification"

Connected through hyperedge HE-6 (induced by source paper "pseudorandom generators for read once branching programs in any order"):
  with members:
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-7 (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"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "an almost linear time algorithm for approximate max flow in undirected graphs and its multicommodity generalizations"
    - "an efficient parallel solver for sdd linear systems"
    - "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-8 (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"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "hitting sets for roabp and sum of set multilinear circuits"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"

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)