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: "enumerative lattice algorithms in any norm via m ellipsoid coverings"
  Abstract: We give a novel algorithm for enumerating lattice points in any convex body, and give applications to several classic lattice problems, including the Shortest and Closest Vector Problems (SVP and CVP, respectively) and Integer Programming (IP). Our enumeration technique relies on a classical concept from asymptotic convex geometry known as the M-ellipsoid, and uses as a crucial subroutine the recent algorithm of Micciancio and Voulgaris (STOC 2010) for lattice problems in the l_2 norm. As a main technical contribution, which may be of independent interest, we build on the techniques of Klartag (Geometric and Functional Analysis, 2006) to give an expected 2^O(n)-time algorithm for computing an M-ellipsoid for any n-dimensional convex body. #R##N#As applications, we give deterministic 2^{O(n)}-time and -space algorithms for solving exact SVP, and exact CVP when the target point is sufficiently close to the lattice, on n-dimensional lattices in any (semi-)norm given an M-ellipsoid of the unit ball. In many norms of interest, including all l_p norms, an M-ellipsoid is computable in deterministic poly(n) time, in which case these algorithms are fully deterministic. Here our approach may be seen as a derandomization of the "AKS sieve" for exact SVP and CVP (Ajtai, Kumar, and Sivakumar; STOC 2001 and CCC 2002). #R##N#As a further application of our SVP algorithm, we derive an expected O(f*(n))^n-time algorithm for Integer Programming, where f*(n) denotes the optimal bound in the so-called "flatness theorem," which satisfies f*(n) = O(n^{4/3} \polylog(n)) and is conjectured to be f*(n)=\Theta(n). Our runtime improves upon the previous best of O(n^{2})^{n} by Hildebrand and Koppe (2010).

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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "covering convex bodies and the closest vector problem"):
  with members:
    - "on compact representations of voronoi cells of lattices"
    - "just take the average an embarrassingly simple 2 n time algorithm for svp and cvp"
    - "a deterministic polynomial space construction for eps nets under any norm"
    - "lattice sparsification and the approximate closest vector problem"
    - "a o 1 eps 2 n time sieving algorithm for approximate integer programming"
    - "covering cubes and the closest vector problem"

Connected through hyperedge HE-3 (induced by source paper "slide reduction revisited filling the gaps in svp approximation"):
  with members:
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"

Connected through hyperedge HE-4 (induced by source paper "on computing centroids according to the p norms of hamming distance vectors"):
  with members:
    - "collective schedules scheduling meets computational social choice"
    - "committee scoring rules axiomatic characterization and hierarchy"
    - "a generalization of the minisum and minimax voting methods"
    - "a note on clustering aggregation"
    - "combinatorial n fold integer programming and applications"
    - "lower bounds for approximation schemes for closest string"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"

Connected through hyperedge HE-5 (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"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "mixed integer programming with convex concave constraints fixed parameter tractability and applications to multicovering and voting"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "faster algorithms for integer programs with block structure"
    - "fair knapsack"
    - "scheduling meets n fold integer programming"
    - "evaluating and tuning n fold integer programming"
    - "combinatorial n fold integer programming and applications"
    - "integer programming in parameterized complexity three miniatures"
    - "solving integer linear programs with a small number of global variables and constraints"

Connected through hyperedge HE-7 (induced by source paper "combinatorial n fold integer programming and applications"):
  with members:
    - "a parameterized strongly polynomial algorithm for block structured integer programs"
    - "on integer programming and convolution"
    - "scheduling meets n fold integer programming"
    - "the complexity landscape of decompositional parameters for ilp"
    - "proximity results and faster algorithms for integer programming using the steinitz lemma"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "voting and bribing in single exponential time"
    - "about the structure of the integer cone and its application to bin packing"

Connected through hyperedge HE-8 (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"
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
    - "short paths on the voronoi graph and the closest vector problem with preprocessing"

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)