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: "hypercontractive inequality for pseudo boolean functions of bounded fourier width"
  Abstract: A function $f:\ \{-1,1\}^n\rightarrow \mathbb{R}$ is called pseudo-Boolean. It is well-known that each pseudo-Boolean function $f$ can be written as $f(x)=\sum_{I\in {\cal F}}\hat{f}(I)\chi_I(x),$ where ${\cal F}\subseteq \{I:\ I\subseteq [n]\}$, $[n]=\{1,2,...,n\}$, and $\chi_I(x)=\prod_{i\in I}x_i$ and $\hat{f}(I)$ are non-zero reals. The degree of $f$ is $\max \{|I|:\ I\in {\cal F}\}$ and the width of $f$ is the minimum integer $\rho$ such that every $i\in [n]$ appears in at most $\rho$ sets in $\cal F$. For $i\in [n]$, let $\mathbf{x}_i$ be a random variable taking values 1 or -1 uniformly and independently from all other variables $\mathbf{x}_j$, $j\neq i.$ Let $\mathbf{x}=(\mathbf{x}_1,...,\mathbf{x}_n)$. The $p$-norm of $f$ is $||f||_p=(\mathbb E[|f(\mathbf{x})|^p])^{1/p}$ for any $p\ge 1$. It is well-known that $||f||_q\ge ||f||_p$ whenever $q> p\ge 1$. However, the higher norm can be bounded by the lower norm times a coefficient not directly depending on $f$: if $f$ is of degree $d$ and $q> p>1$ then $ ||f||_q\le (\frac{q-1}{p-1})^{d/2}||f||_p.$ This inequality is called the Hypercontractive Inequality. We show that one can replace $d$ by $\rho$ in the Hypercontractive Inequality for each $q> p\ge 2$ as follows: $ ||f||_q\le ((2r)!\rho^{r-1})^{1/(2r)}||f||_p,$ where $r=\lceil q/2\rceil$. For the case $q=4$ and $p=2$, which is important in many applications, we prove a stronger inequality: $ ||f||_4\le (2\rho+1)^{1/4}||f||_2.$

Connected through hyperedge HE-1 (induced by source paper "constraint satisfaction problems parameterized above or below tight bounds a survey"):
  with members:
    - "simultaneously satisfying linear equations over mathbb f _2 maxlin2 and max r lin2 parameterized above average"
    - "a new bound for 3 satisfiable maxsat and its algorithmic application"
    - "parameterized complexity of maxsat above average"
    - "on multiway cut parameterized above lower bounds"
    - "improved parameterized algorithms for constraint satisfaction"
    - "a new lower bound on the maximum number of satisfied clauses in max sat and its algorithmic application"
    - "betweenness parameterized above tight lower bound"
    - "a probabilistic approach to problems parameterized above or below tight bounds"

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.DM(Discrete Mathematics)