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 "fooling intersections of low weight halfspaces"):
  Abstract: A weight-$t$ halfspace is a Boolean function $f(x)=$sign$(w_1 x_1 + \cdots + w_n x_n - \theta)$ where each $w_i$ is an integer in $\{-t,\dots,t\}.$ We give an explicit pseudorandom generator that $\delta$-fools any intersection of $k$ weight-$t$ halfspaces with seed length poly$(\log n, \log k,t,1/\delta)$. In particular, our result gives an explicit PRG that fools any intersection of any quasipoly$(n)$ number of halfspaces of any poly$\log(n)$ weight to any $1/$poly$\log(n)$ accuracy using seed length poly$\log(n).$ Prior to this work no explicit PRG with non-trivial seed length was known even for fooling intersections of $n$ weight-1 halfspaces to constant accuracy. #R##N#The analysis of our PRG fuses techniques from two different lines of work on unconditional pseudorandomness for different kinds of Boolean functions. We extend the approach of Harsha, Klivans and Meka \cite{HKM12} for fooling intersections of regular halfspaces, and combine this approach with results of Bazzi \cite{Bazzi:07} and Razborov \cite{Razborov:09} on bounded independence fooling CNF formulas. Our analysis introduces new coupling-based ingredients into the standard Lindeberg method for establishing quantitative central limit theorems and associated pseudorandomness results.

Includes members:
  Member "average case lower bounds and satisfiability algorithms for small threshold circuits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantified derandomization of linear threshold circuits")
  Member "pseudorandomness via the discrete fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fourier bounds and pseudorandom generators for product tests")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coarse grained complexity for dynamic algorithms")
  Member "the average sensitivity of an intersection of half spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "top down induction of decision trees rigorous guarantees and inherent limitations")
  Member "deterministic approximate counting for juntas of degree 2 polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")
  Member "efficient deterministic approximate counting for low degree polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deterministic search for cnf satisfying assignments in almost polynomial time")
  Member "an invariance principle for polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "kruskal katona for convex sets with applications")
  Member "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the complexity of the inverse semivalue problem for weighted voting games")

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)