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 "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.

Includes members:
  Member "an invariance principle for polytopes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "kruskal katona for convex sets with applications")
  Member "fooling functions of halfspaces under product distributions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithms and lower bounds for de morgan formulas of low communication leaf gates")
  Member "polynomial time approximation schemes for knapsack and related counting problems using branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the distribution function of the longest path length in constant treewidth dags with random edge length")
  Member "bounded independence fools halfspaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "list decodable subspace recovery via sum of squares")
  Member "polynomial threshold functions structure approximation and pseudorandomness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a ptas for agnostically learning halfspaces")
  Member "bounding the sensitivity of polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")
  Member "a regularity lemma and low weight approximators for low degree polynomial threshold functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "degree d chow parameters robustly determine degree d ptfs and algorithmic applications")

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)