human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on compact representations of voronoi cells of lattices"):
  Abstract: In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponential space as well. We address the major open question whether there exists such an algorithm that requires only polynomial space. #R##N#To this end, we define a lattice basis to be $c$-compact if every facet normal of the Voronoi cell is a linear combination of the basis vectors using coefficients that are bounded by $c$ in absolute value. Given such a basis, we get a polynomial space algorithm for CVP whose running time naturally depends on $c$. Thus, our main focus is the behavior of the smallest possible value of $c$, with the following results: There always exist $c$-compact bases, where $c$ is bounded by $n^2$ for an $n$-dimension lattice; there are lattices not admitting a $c$-compact basis with $c$ growing sublinearly with the dimension; and every lattice with a zonotopal Voronoi cell has a $1$-compact basis.

Includes members:
  Member "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp":
    also connected through other hyperedges:
      - 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")
  Member "finding a closest point in a lattice of voronoi s first kind":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "deciding whether a lattice has an orthonormal basis is in co np")
  Member "short paths on the voronoi graph and the closest vector problem with preprocessing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the quantitative hardness of cvp")

Question: Please tell me which class the source paper 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)