human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "luby veli v c kovi c wigderson revisited improved correlation bounds and pseudorandom generators for depth two circuits"):
  Abstract: We study correlation bounds and pseudorandom generators for depth-two circuits that consist of a $\mathsf{SYM}$-gate (computing an arbitrary symmetric function) or $\mathsf{THR}$-gate (computing an arbitrary linear threshold function) that is fed by $S$ $\mathsf{AND}$ gates. Such circuits were considered in early influential work on unconditional derandomization of Luby, Veli\v{c}kovi\'c, and Wigderson [LVW93], who gave the first non-trivial PRG with seed length $2^{O(\sqrt{\log(S/\varepsilon)})}$ that $\varepsilon$-fools these circuits. #R##N#In this work we obtain the first strict improvement of [LVW93]'s seed length: we construct a PRG that $\varepsilon$-fools size-$S$ $\{\mathsf{SYM},\mathsf{THR}\} \circ\mathsf{AND}$ circuits over $\{0,1\}^n$ with seed length \[ 2^{O(\sqrt{\log S })} + \mathrm{polylog}(1/\varepsilon), \] an exponential (and near-optimal) improvement of the $\varepsilon$-dependence of [LVW93]. The above PRG is actually a special case of a more general PRG which we establish for constant-depth circuits containing multiple $\mathsf{SYM}$ or $\mathsf{THR}$ gates, including as a special case $\{\mathsf{SYM},\mathsf{THR}\} \circ \mathsf{AC^0}$ circuits. These more general results strengthen previous results of Viola [Vio06] and essentially strengthen more recent results of Lovett and Srinivasan [LS11]. #R##N#Our improved PRGs follow from improved correlation bounds, which are transformed into PRGs via the Nisan--Wigderson "hardness versus randomness" paradigm [NW94]. The key to our improved correlation bounds is the use of a recent powerful \emph{multi-switching} lemma due to H{\aa}stad [H{\aa}s14].

Includes members:
  Member "improved pseudorandom generators from pseudorandom multi switching lemmas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "algorithms and lower bounds for de morgan formulas of low communication leaf gates")
  Member "hardness results for agnostically learning low degree polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nearly tight bounds for robust proper learning of halfspaces with a margin")
  Member "pseudorandom generators for polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")
  Member "bounded independence fools degree 2 threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stable sparse subspace embedding for dimensionality reduction")

Question: Please tell me which class the source paper 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)