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: "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
  Abstract: We give a randomized $2^{n+o(n)}$-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic $\widetilde{O}(4^n)$-time and $\widetilde{O}(2^n)$-space algorithm of Micciancio and Voulgaris (STOC 2010, SIAM J. Comp. 2013). #R##N#In fact, we give a conceptually simple algorithm that solves the (in our opinion, even more interesting) problem of discrete Gaussian sampling (DGS). More specifically, we show how to sample $2^{n/2}$ vectors from the discrete Gaussian distribution at any parameter in $2^{n+o(n)}$ time and space. (Prior work only solved DGS for very large parameters.) Our SVP result then follows from a natural reduction from SVP to DGS. We also show that our DGS algorithm implies a $2^{n + o(n)}$-time algorithm that approximates the Closest Vector Problem to within a factor of $1.97$. #R##N#In addition, we give a more refined algorithm for DGS above the so-called smoothing parameter of the lattice, which can generate $2^{n/2}$ discrete Gaussian samples in just $2^{n/2+o(n)}$ time and space. Among other things, this implies a $2^{n/2+o(n)}$-time and space algorithm for $1.93$-approximate decision SVP.

Connected through hyperedge HE-1 (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"
    - "on the quantitative hardness of cvp"
    - "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-2 (induced by source paper "slide reduction revisited filling the gaps in svp approximation"):
  with members:
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"

Connected through hyperedge HE-3 (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"
    - "on the quantitative hardness of cvp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "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-4 (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"
    - "on the quantitative hardness of cvp"
    - "covering cubes and the closest vector problem"

Connected through hyperedge HE-5 (induced by source paper "on the quantitative hardness of cvp"):
  with members:
    - "on problems as hard as cnf sat"
    - "strong eth breaks with merlin and arthur short non interactive proofs of batch evaluation"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"
    - "powers of tensors and fast matrix multiplication"
    - "edit distance cannot be computed in strongly subquadratic time unless seth is false"
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"
    - "on the closest vector problem with a distance guarantee"

Connected through hyperedge HE-6 (induced by source paper "space efficient classical and quantum algorithms for the shortest vector problem"):
  with members:
    - "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"
    - "improved analysis of kannan s shortest lattice vector algorithm"

Connected through hyperedge HE-7 (induced by source paper "sieving for closest lattice vectors with preprocessing"):
  with members:
    - "tradeoffs for nearest neighbors on the sphere"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"
    - "hashing for similarity search a survey"
    - "on the closest vector problem with a distance guarantee"

Connected through hyperedge HE-8 (induced by source paper "solving the closest vector problem in 2 n time the discrete gaussian strikes again"):
  with members:
    - "discrete gaussian sampling reduces to cvp and svp"
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"
    - "on the closest vector problem with a distance guarantee"
    - "classical hardness of learning with errors"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"
    - "lattice sparsification and the approximate closest vector problem"
    - "approximating the closest vector problem using an approximate shortest vector oracle"
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"

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)