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: "large minors in expanders"
  Abstract: In this paper we study expander graphs and their minors. Specifically, we attempt to answer the following question: what is the largest function $f(n,\alpha,d)$, such that every $n$-vertex $\alpha$-expander with maximum vertex degree at most $d$ contains {\bf every} graph $H$ with at most $f(n,\alpha,d)$ edges and vertices as a minor? Our main result is that there is some universal constant $c$, such that $f(n,\alpha,d)\geq \frac{n}{c\log n}\cdot \left(\frac{\alpha}{d}\right )^c$. This bound achieves a tight dependence on $n$: it is well known that there are bounded-degree $n$-vertex expanders, that do not contain any grid with $\Omega(n/\log n)$ vertices and edges as a minor. The best previous result showed that $f(n,\alpha,d) \geq \Omega(n/\log^{\kappa}n)$, where $\kappa$ depends on both $\alpha$ and $d$. Additionally, we provide a randomized algorithm, that, given an $n$-vertex $\alpha$-expander with maximum vertex degree at most $d$, and another graph $H$ containing at most $\frac{n}{c\log n}\cdot \left(\frac{\alpha}{d}\right )^c$ vertices and edges, with high probability finds a model of $H$ in $G$, in time poly$(n)\cdot (d/\alpha)^{O\left( \log(d/\alpha) \right)}$. #R##N#We note that similar but stronger results were independently obtained by Krivelevich and Nenadov: they show that $f(n,\alpha,d)=\Omega \left(\frac{n\alpha^2}{d^2\log n} \right)$, and provide an efficient algorithm, that, given an $n$-vertex $\alpha$-expander of maximum vertex degree at most $d$, and a graph $H$ with $O\left( \frac{n\alpha^2}{d^2\log n} \right)$ vertices and edges, finds a model of $H$ in $G$. #R##N#Finally, we observe that expanders are the `most minor-rich' family of graphs in the following sense: for every $n$-vertex and $m$-edge graph $G$, there exists a graph $H$ with $O \left( \frac{n+m}{\log n} \right)$ vertices and edges, such that $H$ is not a minor of $G$.

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.DS(Data Structures and Algorithms)