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: "an invariance principle for polytopes"
  Abstract: Let X be randomly chosen from {-1,1}n, and let Y be randomly chosen from the standard spherical Gaussian on ℝn. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr[X ∈ P] - Pr[Y ∈ P]| ≤ log8/5k ṡ Δ, where Δ is a parameter that is small for polytopes formed by the intersection of “regular” halfspaces (i.e., halfspaces with low influence). The novelty of our invariance principle is the polylogarithmic dependence on k. Previously, only bounds that were at least linear in k were known. The proof of the invariance principle is based on a generalization of the Lindeberg method for proving central limit theorems and could be of use elsewhere.   We give two important applications of our invariance principle, one from learning theory and the other from pseudorandomness.   (1) A bound of logO(1)k ṡ e1/6 on the Boolean noise sensitivity of intersections of k “regular” halfspaces (previous work gave bounds linear in k). This gives a corresponding agnostic learning algorithm for intersections of regular halfspaces.   (2) A pseudorandom generator (PRG) for estimating the Gaussian volume of polytopes with k faces within error Δ and seed-length O(log n poly(log k,1/Δ)).   We also obtain PRGs with similar parameters that fool polytopes formed by intersection of regular halfspaces over the hypercube. Using our PRG constructions, we obtain the first deterministic quasi-polynomial time algorithms for approximately counting the number of solutions to a broad class of integer programs, including dense covering problems and contingency tables.

Connected through hyperedge HE-1 (induced by source paper "kruskal katona for convex sets with applications"):
  with members:
    - "learning geometric concepts with nasty noise"
    - "beyond talagrand functions new lower bounds for testing monotonicity and unateness"
    - "a polynomial lower bound for testing monotonicity"
    - "analysis of boolean functions"
    - "boolean function monotonicity testing requires almost n 1 2 non adaptive queries"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "average sensitivity and noise sensitivity of polynomial threshold 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"
    - "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"
    - "k independent gaussians fool polynomial threshold functions"

Connected through hyperedge HE-3 (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"
    - "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry"
    - "fooling functions of halfspaces under product distributions"

Connected through hyperedge HE-4 (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-5 (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"
    - "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"
    - "k independent gaussians fool polynomial threshold functions"

Connected through hyperedge HE-6 (induced by source paper "the average sensitivity of an intersection of half spaces"):
  with members:
    - "average sensitivity and noise sensitivity of polynomial threshold functions"

Connected through hyperedge HE-7 (induced by source paper "fooling functions of halfspaces under product distributions"):
  with members:
    - "agnostic learning of monomials by halfspaces is hard"
    - "bounded independence fools halfspaces"
    - "polynomial threshold functions structure approximation and pseudorandomness"
    - "pseudorandom generators for polynomial threshold functions"
    - "bounded independence fools degree 2 threshold functions"

Connected through hyperedge HE-8 (induced by source paper "pseudorandom generators for polynomial threshold functions"):
  with members:
    - "fooling functions of halfspaces under product distributions"
    - "polynomial time approximation schemes for knapsack and related counting problems using branching programs"
    - "bounded independence fools halfspaces"
    - "polynomial threshold functions structure approximation and pseudorandomness"
    - "bounding the sensitivity of polynomial threshold functions"
    - "a regularity lemma and low weight approximators for 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)