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: "k independent gaussians fool polynomial threshold functions"
  Abstract: We show that any $O_d(\epsilon^{-4d 7^d})$-independent family of Gaussians $\epsilon$-fools any degree-$d$ polynomial threshold function.

Connected through hyperedge HE-1 (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-2 (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"
    - "fooling functions of halfspaces under product distributions"

Connected through hyperedge HE-3 (induced by source paper "polynomial bounds for decoupling with applications"):
  with members:
    - "beating the random assignment on constraint satisfaction problems of bounded degree"
    - "analysis of boolean functions"
    - "a prg for lipschitz functions of polynomials with applications to sparsest cut"

Connected through hyperedge HE-4 (induced by source paper "almost optimal pseudorandom generators for spherical caps"):
  with members:
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "a method of moments for mixture models and hidden markov models"
    - "a small prg for polynomial threshold functions of gaussians"
    - "bounded independence fools halfspaces"
    - "polynomial threshold functions structure approximation and pseudorandomness"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-5 (induced by source paper "a polylogarithmic prg for degree 2 threshold functions in the gaussian setting"):
  with members:
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "a small prg for polynomial threshold functions of gaussians"
    - "bounded independence fools halfspaces"
    - "pseudorandom generators for polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-6 (induced by source paper "deterministic approximate counting for degree 2 polynomial threshold functions"):
  with members:
    - "deterministic approximate counting for juntas of degree 2 polynomial threshold functions"
    - "efficient deterministic approximate counting for low degree polynomial threshold functions"
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "correlation decay up to uniqueness in spin systems"
    - "a small prg for polynomial threshold functions of gaussians"
    - "hardness results for agnostically learning low degree polynomial threshold functions"

Connected through hyperedge HE-7 (induced by source paper "deterministic approximate counting for juntas of degree 2 polynomial threshold functions"):
  with members:
    - "deterministic approximate counting for degree 2 polynomial threshold functions"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "fooling functions of halfspaces under product distributions"
    - "hardness results for agnostically learning low degree polynomial threshold functions"
    - "bounded independence fools halfspaces"
    - "polynomial threshold functions structure approximation and pseudorandomness"
    - "bounding the sensitivity of polynomial threshold functions"

Connected through hyperedge HE-8 (induced by source paper "efficient deterministic approximate counting for low degree polynomial threshold functions"):
  with members:
    - "deterministic approximate counting for juntas of degree 2 polynomial threshold functions"
    - "deterministic approximate counting for degree 2 polynomial threshold functions"
    - "a pseudorandom generator for polynomial threshold functions of gaussian with subpolynomial seed length"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "a small prg for polynomial threshold functions of gaussians"
    - "fooling functions of halfspaces under product distributions"
    - "hardness results for agnostically learning low degree polynomial threshold functions"

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)