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: "pseudorandom generators for polynomial threshold functions"
  Abstract: We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no nontrivial constructions were known even for quadratic threshold functions and constant error eps. For the class of degree 1 threshold functions or halfspaces, we construct PRGs with much better dependence on the error parameter eps and obtain a PRG with seed-length O(log n + log^2(1/eps)). Previously, only PRGs with seed length O(log n log^2(1/eps)/eps^2) were known for halfspaces. We also obtain PRGs with similar seed lengths for fooling halfspaces over the n-dimensional unit sphere. #R##N#The main theme of our constructions and analysis is the use of invariance principles to construct pseudorandom generators. We also introduce the notion of monotone read-once branching programs, which is key to improving the dependence on the error rate eps for halfspaces. These techniques may be of independent interest.

Connected through hyperedge HE-1 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications"):
  with members:
    - "learning geometric concepts with nasty noise"
    - "hardness of learning noisy halfspaces using polynomial thresholds"
    - "robust estimators in high dimensions without the computational intractability"
    - "pseudorandomness via the discrete fourier transform"
    - "complexity theoretic limitations on learning halfspaces"
    - "super linear gate and super quadratic wire lower bounds for depth two and depth three threshold circuits"
    - "a ptas for agnostically learning halfspaces"
    - "analysis of boolean functions"

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"
    - "fooling functions of halfspaces under product distributions"

Connected through hyperedge HE-3 (induced by source paper "average case lower bounds and satisfiability algorithms for small threshold circuits"):
  with members:
    - "analysis of boolean functions"
    - "new algorithms and lower bounds for circuits with linear threshold gates"
    - "a tail bound for read k families of functions"
    - "a satisfiability algorithm for sparse depth two threshold circuits"
    - "a satisfiability algorithm for ac 0"
    - "average sensitivity and noise sensitivity of polynomial threshold functions"
    - "bounded independence fools halfspaces"
    - "bounding the sensitivity of polynomial threshold functions"

Connected through hyperedge HE-4 (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"
    - "fooling functions of halfspaces under product distributions"
    - "bounded independence fools halfspaces"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-5 (induced by source paper "luby veli v c kovi c wigderson revisited improved correlation bounds and pseudorandom generators for depth two circuits"):
  with members:
    - "improved pseudorandom generators from pseudorandom multi switching lemmas"
    - "hardness results for agnostically learning low degree polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-6 (induced by source paper "a faster fptas for knapsack"):
  with members:
    - "bounded independence fools halfspaces"

Connected through hyperedge HE-7 (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-8 (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"

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)