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 "bounded independence fools degree 2 threshold functions"):
  Abstract: Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open question of Diakonikolas et al. (FOCS 2009). Using standard constructions of k-wise independent distributions, we obtain a broad class of explicit generators that epsilon-fool the class of degree-2 threshold functions with seed length log(n)*poly(1/epsilon). #R##N#Our approach is quite robust: it easily extends to yield that the intersection of any constant number of degree-2 threshold functions is epsilon-fooled by poly(1/epsilon)-wise independence. Our results also hold if the entries of x are k-wise independent standard normals, implying for example that bounded independence derandomizes the Goemans-Williamson hyperplane rounding scheme. #R##N#To achieve our results, we introduce a technique we dub multivariate FT-mollification, a generalization of the univariate form introduced by Kane et al. (SODA 2010) in the context of streaming algorithms. Along the way we prove a generalized hypercontractive inequality for quadratic forms which takes the operator norm of the associated matrix into account. 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 "bounded independence fools halfspaces":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "a ptas for agnostically learning halfspaces")
  Member "the intersection of two halfspaces has high threshold degree":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "a regularity lemma and low weight approximators for low degree 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 "pseudorandom generators for 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)