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: "the average sensitivity of bounded depth formulas"
  Abstract: We show that unbounded fan-in boolean formulas of depth $d+1$ and size $s$ have average sensitivity $O(\frac{1}{d}\log s)^d$. In particular, this gives a tight $2^{\Omega(d(n^{1/d}-1))}$ lower bound on the size of depth $d+1$ formulas computing the \textsc{parity} function. These results strengthen the corresponding $2^{\Omega(n^{1/d})}$ and $O(\log s)^d$ bounds for circuits due to H{\aa}stad (1986) and Boppana (1997). Our proof technique studies a random process where the Switching Lemma is applied to formulas in an efficient manner.

Connected through hyperedge HE-1 (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"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "a counterexample to the generalized linial nisan conjecture"

Connected through hyperedge HE-2 (induced by source paper "subspace invariant ac 0 formulas"):
  with members:
    - "on symmetric circuits and fixed point logics"

Connected through hyperedge HE-3 (induced by source paper "small depth multilinear formula lower bounds for iterated matrix multiplication with applications"):
  with members:
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "improved bounds for reduction to depth 4 and depth 3"
    - "homogeneous formulas and symmetric polynomials"

Connected through hyperedge HE-4 (induced by source paper "a duality between depth three formulas and approximation by depth two"):
  with members:
    - "addition is exponentially harder than counting for shallow monotone circuits"
    - "formulas vs circuits for small distance connectivity"

Connected through hyperedge HE-5 (induced by source paper "separation of ac 0 oplus formulas and circuits"):
  with members:
    - "bounds on the size of small depth circuits for approximating majority"

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)