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: "fooling functions of halfspaces under product distributions"
  Abstract: We construct pseudorandom generators that fool functions of halfspaces (threshold functions) under a very broad class of product distributions. This class includes not only familiar cases such as the uniform distribution on the discrete cube, the uniform distribution on the solid cube, and the multivariate Gaussian distribution, but also includes any product of discrete distributions with probabilities bounded away from 0. #R##N#Our first main result shows that a recent pseudorandom generator construction of Meka and Zuckerman [MZ09], when suitably modifed, can fool arbitrary functions of d halfspaces under product distributions where each coordinate has bounded fourth moment. To eps-fool any size-s, depth-d decision tree of halfspaces, our pseudorandom generator uses seed length O((d log(ds/eps)+log n) log(ds/eps)). For monotone functions of d halfspaces, the seed length can be improved to O((d log(d/eps)+log n) log(d/eps)). We get better bounds for larger eps; for example, to 1/polylog(n)-fool all monotone functions of (log n)= log log n halfspaces, our generator requires a seed of length just O(log n). Our second main result generalizes the work of Diakonikolas et al. [DGJ+09] to show that bounded independence suffices to fool functions of halfspaces under product distributions. Assuming each coordinate satisfies a certain stronger moment condition, we show that any function computable by a size-s, depth-d decision tree of halfspaces is eps-fooled by O(d^4s^2/eps^2)-wise independence.

Connected through hyperedge HE-1 (induced by source paper "algorithms and lower bounds for de morgan formulas of low communication leaf gates"):
  with members:
    - "improved pseudorandom generators from pseudorandom multi switching lemmas"
    - "tighter connections between formula sat and shaving logs"
    - "classical algorithms from quantum and arthur merlin communication protocols"
    - "fooling polytopes"
    - "on polynomial approximations to ac 0"
    - "conspiracies between learning algorithms circuit lower bounds and pseudorandomness"
    - "polynomial representations of threshold functions and algorithmic applications"

Connected through hyperedge HE-2 (induced by source paper "fooling polytopes"):
  with members:
    - "fooling intersections of low weight halfspaces"
    - "pseudorandomness via the discrete fourier transform"
    - "analysis of boolean functions"
    - "the average sensitivity of an intersection of half spaces"
    - "an invariance principle for polytopes"
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "a small prg for polynomial threshold functions of gaussians"
    - "k independent gaussians fool polynomial threshold functions"

Connected through hyperedge HE-3 (induced by source paper "deterministic search for cnf satisfying assignments in almost polynomial time"):
  with members:
    - "on polynomial approximations to ac 0"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "efficient deterministic approximate counting for low degree polynomial threshold functions"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "bounded independence fools halfspaces"
    - "pseudorandom generators for polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-4 (induced by source paper "fooling intersections of low weight halfspaces"):
  with members:
    - "average case lower bounds and satisfiability algorithms for small threshold circuits"
    - "pseudorandomness via the discrete fourier transform"
    - "analysis of boolean functions"
    - "the average sensitivity of an intersection of half spaces"
    - "deterministic approximate counting for juntas of degree 2 polynomial threshold functions"
    - "efficient deterministic approximate counting for low degree polynomial threshold functions"
    - "an invariance principle for polytopes"
    - "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry"

Connected through hyperedge HE-5 (induced by source paper "quantified derandomization of linear threshold circuits"):
  with members:
    - "deterministic search for cnf satisfying assignments in almost polynomial time"
    - "average case lower bounds and satisfiability algorithms for small threshold circuits"
    - "randomness extraction in ac0 and with small locality"
    - "pseudorandomness via the discrete fourier transform"
    - "super linear gate and super quadratic wire lower bounds for depth two and depth three threshold circuits"
    - "analysis of boolean functions"
    - "new algorithms and lower bounds for circuits with linear threshold gates"
    - "almost optimal pseudorandom generators for spherical caps"

Connected through hyperedge HE-6 (induced by source paper "pseudorandomness via the discrete fourier transform"):
  with members:
    - "pseudorandomness for concentration bounds and signed majorities"
    - "almost optimal pseudorandom generators for spherical caps"
    - "inequalities and tail bounds for elementary symmetric polynomial with applications"
    - "an invariance principle for polytopes"
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "a small prg for polynomial threshold functions of gaussians"
    - "k independent gaussians fool polynomial threshold functions"

Connected through hyperedge HE-7 (induced by source paper "weighted polynomial approximations limits for learning and pseudorandomness"):
  with members:
    - "pseudorandomness for concentration bounds and signed majorities"
    - "analysis of boolean functions"
    - "agnostic learning of disjunctions on symmetric distributions"
    - "approximate resilience monotonicity and the complexity of agnostic learning"
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "the complexity of learning halfspaces using generalized linear methods"
    - "a derandomized sparse johnson lindenstrauss transform"
    - "bounded independence fools halfspaces"

Connected through hyperedge HE-8 (induced by source paper "analysis of boolean functions"):
  with members:
    - "improved bounds for the randomized decision tree complexity of recursive majority"
    - "some improvements to total degree tests"
    - "dnf sparsification and a faster deterministic counting algorithm"
    - "hypercontractive inequalities via sos with an application to vertex cover"
    - "hypercontractivity sum of squares proofs and their applications"
    - "majority is stablest discrete and sos"
    - "a satisfiability algorithm for ac 0"
    - "the influence lower bound via query elimination"

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)