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: "a robust khintchine inequality and algorithms for computing optimal constants in fourier analysis and high dimensional geometry"
  Abstract: This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. #R##N#\begin{enumerate} #R##N#\item It has been known since 1994 \cite{GL:94} that every linear threshold function has squared Fourier mass at least 1/2 on its degree-0 and degree-1 coefficients. Denote the minimum such Fourier mass by $\w^{\leq 1}[\ltf]$, where the minimum is taken over all $n$-variable linear threshold functions and all $n \ge 0$. Benjamini, Kalai and Schramm \cite{BKS:99} have conjectured that the true value of $\w^{\leq 1}[\ltf]$ is $2/\pi$. We make progress on this conjecture by proving that $\w^{\leq 1}[\ltf] \geq 1/2 + c$ for some absolute constant $c>0$. The key ingredient in our proof is a "robust" version of the well-known Khintchine inequality in functional analysis, which we believe may be of independent interest. #R##N#\item We give an algorithm with the following property: given any $\eta > 0$, the algorithm runs in time $2^{\poly(1/\eta)}$ and determines the value of $\w^{\leq 1}[\ltf]$ up to an additive error of $\pm\eta$. We give a similar $2^{{\poly(1/\eta)}}$-time algorithm to determine \emph{Tomaszewski's constant} to within an additive error of $\pm \eta$; this is the minimum (over all origin-centered hyperplanes $H$) fraction of points in $\{-1,1\}^n$ that lie within Euclidean distance 1 of $H$. Tomaszewski's constant is conjectured to be 1/2; lower bounds on it have been given by Holzman and Kleitman \cite{HK92} and independently by Ben-Tal, Nemirovski and Roos \cite{BNR02}. #R##N#Our algorithms combine tools from anti-concentration of sums of independent random variables, Fourier analysis, and Hermite analysis of linear threshold functions. #R##N#\end{enumerate}

Connected through hyperedge HE-1 (induced by source paper "on the complexity of the inverse semivalue problem for weighted voting games"):
  with members:
    - "degree d chow parameters robustly determine degree d ptfs and algorithmic applications"
    - "algorithmic bayesian persuasion"
    - "public projects boolean functions and the borders of border s theorem"
    - "the inverse shapley value problem"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "the complexity of power index comparison"
    - "complexity of comparison of influence of players in simple games"

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

Connected through hyperedge HE-3 (induced by source paper "subdeterminant maximization via nonconvex relaxations and anti concentration"):
  with members:
    - "a generalization of permanent inequalities and applications in counting and optimization"
    - "how to be fair and diverse"
    - "on the complexity of constrained determinantal point processes"
    - "real stable polynomials and matroids optimization and counting"
    - "analysis of boolean functions"
    - "on largest volume simplices and sub determinants"
    - "randomized rounding for the largest simplex problem"

Connected through hyperedge HE-4 (induced by source paper "public projects boolean functions and the borders of border s theorem"):
  with members:
    - "analysis of boolean functions"
    - "the complexity of optimal multidimensional pricing"
    - "bayesian optimal auctions via multi to single agent reduction"
    - "optimal multi dimensional mechanism design reducing revenue to welfare maximization"
    - "the complexity of optimal mechanism design"
    - "nearly optimal solutions for the chow parameters problem and low weight approximation of halfspaces"
    - "an algorithmic characterization of multi dimensional mechanisms"
    - "optimal auctions with correlated bidders are easy"

Connected through hyperedge HE-5 (induced by source paper "boolean function monotonicity testing requires almost n 1 2 non adaptive queries"):
  with members:
    - "new algorithms and lower bounds for monotonicity testing"
    - "a o n monotonicity tester for boolean functions over the hypercube"
    - "fooling functions of halfspaces under product distributions"

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)