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 closest vector problem with respect to ell_p norms"
  Abstract: We present deterministic polynomially space bounded algorithms for the closest vector problem for all lp-norms, 1 < p < ∞, and all polyhedral norms, in particular for the l1norm and the l∞-norm. For all lp-norms with 1 < p < ∞ the running time of the algorithm is p · log 2 (r) O(1) n (2+o(1))n , where r is an upper bound on the size of the coefficients of the target vector and the lattice basis and n is the dimension of the vector space. For polyhedral norms, we obtain an algorithm with running time (slog 2 (r)) O(1) n (2+o(1))n , where r and n are defined as above and s is the number of constraints defining the polytope. In particular, for the l1-norm and the l∞-norm, we obtain a deterministic algorithm for the closest vector problem with running time log 2 (r) O(1) n (2+o(1))n . We achieve our results by introducing a new lattice problem, the lattice membership problem: For a given full-dimensional bounded convex set and a given lattice, the goal is to decide whether the convex set contains a lattice vector or not. The lattice membership problem is a generalization of the integer programming feasibility problem from polyhedra to bounded convex sets. In this paper, we describe a deterministic algorithm for the lattice membership problem, which is a generalization of Lenstra’s algorithm for integer programming. We also describe a polynomial time reduction from the closest vector problem to the lattice membership problem. This approach leads to a deterministic algorithm that solves the closest vector problem in polynomial space for all lp-norms, 1 < p < ∞, and all polyhedral norms.

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)