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 coin problem in constant depth sample complexity and parity gates"
  Abstract: The $\textit{\delta-Coin Problem}$ is the computational problem of distinguishing between coins that are heads with probability $(1+\delta)/2$ or $(1-\delta)/2,$ where $\delta$ is a parameter tending to $0$. We study this problem's complexity in the model of constant-depth Boolean circuits and prove the following results. #R##N#$\textbf{Upper bounds.}$ For any constant $d\geq 2$, we show that there are $\textit{explicit}$ monotone AC$^0$ formulas (i.e. made up of AND and OR gates only) solving the $\delta$-coin problem, having depth $d$, size $\exp(O(d(1/\delta)^{1/(d-1)}))$, and sample complexity (no. of inputs) poly$(1/\delta).$ This matches previous upper bounds of O'Donnell and Wimmer (ICALP 2007) and Amano (ICALP 2009) in terms of size (which is optimal) and improves the sample complexity from $\exp(O(d(1/\delta)^{1/(d-1)}))$ to poly$(1/\delta)$. #R##N#$\textbf{Lower bounds.}$ We show that the above upper bounds are nearly tight even for the significantly stronger model of AC$^0[\oplus]$ formulas (i.e. allowing NOT and Parity gates): formally, we show that any AC$^0[\oplus]$ formula solving the $\delta$-coin problem must have size $\exp(\Omega(d(1/\delta)^{1/(d-1)})).$ This strengthens a result of Cohen, Ganor and Raz (APPROX-RANDOM 2014), who prove a similar result for AC$^0$, and a result of Shaltiel and Viola (SICOMP 2010), which implies a superpolynomially weaker (still exponential) lower bound. #R##N#The above yields the first class of $\textit{explicit}$ functions where we have nearly (up to a polynomial factor) matching upper and lower bounds for the class of AC$^0[\oplus]$ formulas. In particular, this yields the first $\textit{Fixed-depth Size-Hierarchy Theorem}$ for the uniform version of this class: our results imply that for any fixed $d$, the class $\mathcal{C}_{d,k}$ of functions that have uniform AC$^0[\oplus]$ formulas of depth $d$ and size $n^k$ form an infinite hierarchy.

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"
    - "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"
    - "better pseudorandom generators from milder pseudorandom restrictions"

Connected through hyperedge HE-2 (induced by source paper "on the text ac 0 oplus complexity of andreev s problem"):
  with members:
    - "coin theorems and the fourier expansion"
    - "analysis of boolean functions"
    - "the weights in mds codes"

Connected through hyperedge HE-3 (induced by source paper "coin theorems and the fourier expansion"):
  with members:
    - "fourier bounds and pseudorandom generators for product tests"
    - "pseudorandomness and fourier growth bounds for width 3 branching programs"
    - "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)