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: "improved analysis of kannan s shortest lattice vector algorithm"
  Abstract: The security of lattice-based cryptosystems such as NTRU, GGH and Ajtai-Dwork essentially relies upon the intractability of computing a shortest non-zero lattice vector and a closest lattice vector to a given target vector in high dimensions. The best algorithms for these tasks are due to Kannan, and, though remarkably simple, their complexity estimates have not been improved since over twenty years. Kannan's algorithm for solving the shortest vector problem (SVP) is in particular crucial in Schnorr's celebrated block reduction algorithm, on which rely the best known generic attacks against the lattice-based encryption schemes mentioned above. In this paper we improve the complexity upper-bounds of Kannan's algorithms. The analysis provides new insight on the practical cost of solving SVP, and helps progressing towards providing meaningful key-sizes.

Connected through hyperedge HE-1 (induced by source paper "improved provable algorithms for the shortest vector problem via bounded distance decoding"):
  with members:
    - "discrete gaussian sampling reduces to cvp and svp"
    - "tensor based hardness of the shortest vector problem to within almost polynomial factors"

Connected through hyperedge HE-2 (induced by source paper "a note on the security of csidh"):
  with members:
    - "towards practical key exchange from ordinary isogeny graphs"

Connected through hyperedge HE-3 (induced by source paper "on the kz reduction"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "boosted kz and lll algorithms"
    - "a modified kz reduction algorithm"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "successive integer forcing and its sum rate optimality"
    - "decoding by embedding correct decoding radius and dmt optimality"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"

Connected through hyperedge HE-4 (induced by source paper "a kz reduction algorithm"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "an efficient optimal algorithm for the successive minima problem"
    - "success probability of the babai estimators for box constrained integer linear models"
    - "successive integer forcing and its sum rate optimality"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "effects of the lll reduction on the success probability of the babai point and on the complexity of sphere decoding"
    - "on the proximity factors of lattice reduction aided decoding"

Connected through hyperedge HE-5 (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"
    - "solving the shortest vector problem in 2 n time via discrete gaussian sampling"
    - "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-6 (induced by source paper "an efficient optimal algorithm for the successive minima problem"):
  with members:
    - "effects of some lattice reductions on the success probability of the zero forcing decoder"
    - "on the kz reduction"
    - "boosted kz and lll algorithms"
    - "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes"
    - "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations"
    - "compute compress and forward exploiting asymmetry of wireless relay networks"
    - "full diversity unitary precoded integer forcing"
    - "success probability of the babai estimators for box constrained integer linear models"

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

Connected through hyperedge HE-8 (induced by source paper "short paths on the voronoi graph and the closest vector problem with preprocessing"):
  with members:
    - "on the closest vector problem with a distance guarantee"

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.CR(Cryptography and Security)