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: "bounds on the size of small depth circuits for approximating majority"
  Abstract: In this paper, we show that for every constant $0 < \epsilon < 1/2$ and for every constant $d \geq 2$, the minimum size of a depth $d$ Boolean circuit that $\epsilon$-approximates Majority function on $n$ variables is exp$(\Theta(n^{1/(2d-2)}))$. The lower bound for every $d \geq 2$ and the upper bound for $d=2$ have been previously shown by O'Donnell and Wimmer [ICALP'07], and the contribution of this paper is to give a matching upper bound for $d \geq 3$.

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"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "an entropic proof of chang s inequality"

Connected through hyperedge HE-2 (induced by source paper "the coin problem in constant depth sample complexity and parity gates"):
  with members:
    - "analysis of boolean functions"

Connected through hyperedge HE-3 (induced by source paper "separation of ac 0 oplus formulas and circuits"):
  with members:
    - "the average sensitivity of bounded depth formulas"

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)