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: "on the quantitative hardness of cvp"
  Abstract: $ \newcommand{\eps}{\varepsilon} \newcommand{\problem}[1]{\ensuremath{\mathrm{#1}} } \newcommand{\CVP}{\problem{CVP}} \newcommand{\SVP}{\problem{SVP}} \newcommand{\CVPP}{\problem{CVPP}} \newcommand{\ensuremath}[1]{#1} $For odd integers $p \geq 1$ (and $p = \infty$), we show that the Closest Vector Problem in the $\ell_p$ norm ($\CVP_p$) over rank $n$ lattices cannot be solved in $2^{(1-\eps) n}$ time for any constant $\eps > 0$ unless the Strong Exponential Time Hypothesis (SETH) fails. We then extend this result to "almost all" values of $p \geq 1$, not including the even integers. This comes tantalizingly close to settling the quantitative time complexity of the important special case of $\CVP_2$ (i.e., $\CVP$ in the Euclidean norm), for which a $2^{n +o(n)}$-time algorithm is known. In particular, our result applies for any $p = p(n) \neq 2$ that approaches $2$ as $n \to \infty$. #R##N#We also show a similar SETH-hardness result for $\SVP_\infty$; hardness of approximating $\CVP_p$ to within some constant factor under the so-called Gap-ETH assumption; and other quantitative hardness results for $\CVP_p$ and $\CVPP_p$ for any $1 \leq p < \infty$ under different assumptions.

Connected through hyperedge HE-1 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms"):
  with members:
    - "fine grained hardness of cvp p everything that we can prove and nothing else"
    - "gap s eth hardness of svp"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"
    - "on the closest vector problem with a distance guarantee"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"

Connected through hyperedge HE-2 (induced by source paper "faster provable sieving algorithms for the shortest vector problem and the closest vector problem on lattices in 120001 p norm"):
  with members:
    - "the projection games conjecture and the hardness of approximation of ssat and related problems"
    - "improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm"
    - "gap s eth hardness of svp"
    - "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp"
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
    - "near optimal deterministic algorithms for volume computation via m ellipsoids"
    - "classical hardness of learning with errors"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"

Connected through hyperedge HE-3 (induced by source paper "parameterized intractability of even set and shortest vector problem"):
  with members:
    - "gap s eth hardness of svp"
    - "parameterized complexity of csp for infinite constraint languages"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "on the hardness of learning sparse parities"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"
    - "a simple deterministic reduction for the gap minimum distance of code problem"
    - "new lattice based cryptographic constructions"

Connected through hyperedge HE-4 (induced by source paper "the projection games conjecture and the hardness of approximation of ssat and related problems"):
  with members:
    - "gap s eth hardness of svp"
    - "classical hardness of learning with errors"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"
    - "covering cubes and the closest vector problem"

Connected through hyperedge HE-5 (induced by source paper "fine grained hardness of cvp p everything that we can prove and nothing else"):
  with members:
    - "gap s eth hardness of svp"
    - "a o 1 eps 2 n time sieving algorithm for approximate integer programming"

Connected through hyperedge HE-6 (induced by source paper "gap s eth hardness of svp"):
  with members:
    - "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"

Connected through hyperedge HE-7 (induced by source paper "improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm"):
  with members:
    - "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp"
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
    - "covering cubes and the closest vector problem"

Connected through hyperedge HE-8 (induced by source paper "parameterized intractability of even set and shortest vector problem from gap eth"):
  with members:
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "the parameterized complexity of k biclique"
    - "new lattice based cryptographic constructions"

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)