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: "tensor based hardness of the shortest vector problem to within almost polynomial factors"
  Abstract: We show that unless NP⊆RTIME(2poly(logn)), there is no polynomial-time algorithm approximating the Shortest Vector Problem (SVP) on n-dimensional lattices in the lp norm (1≤p 0. This improves the previous best factor of 2(logn)1/2−e under the same complexity assumption due to Khot (J. ACM, 2005). Under the stronger assumption NP⊈RSUBEXP, we obtain a hardness factor of nc/loglogn for some c>0.#R##N##R##N#Our proof starts with Khot's SVP instances that are hard to approximate to within some constant. To boost the hardness factor we simply apply the standard tensor product of lattices. The main novel part is in the analysis, where we show that the lattices of Khot behave nicely under tensorization. At the heart of the analysis is a certain matrix inequality which was first used in the context of lattices by de Shalit and Parzanchevski.

Connected through hyperedge HE-1 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms"):
  with members:
    - "fine grained hardness of cvp p everything that we can prove and nothing else"
    - "gap s eth hardness of svp"
    - "on the quantitative hardness of cvp"
    - "discrete gaussian sampling reduces to cvp and svp"
    - "solving the closest vector problem in 2 n time the discrete gaussian strikes again"
    - "on the closest vector problem with a distance guarantee"

Connected through hyperedge HE-2 (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"
    - "improved analysis of kannan s shortest lattice vector algorithm"

Connected through hyperedge HE-3 (induced by source paper "tight running time lower bounds for strong inapproximability of maximum k coverage unique set cover and related problems via t wise agreement testing theorem"):
  with members:
    - "a simple gap producing reduction for the parameterized set cover problem"
    - "parameterized intractability of even set and shortest vector problem"
    - "parameterized inapproximability of exact cover and nearest codeword"
    - "tight fpt approximations for k median and k means"
    - "agreement testing theorems on layered set systems"
    - "towards a general direct product testing theorem"
    - "gap s eth hardness of svp"
    - "eth hardness of approximating 2 csps and directed steiner network"

Connected through hyperedge HE-4 (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-5 (induced by source paper "parameterized intractability of even set and shortest vector problem"):
  with members:
    - "gap s eth hardness of svp"
    - "parameterized complexity of csp for infinite constraint languages"
    - "on the quantitative hardness of cvp"
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "on the hardness of learning sparse parities"
    - "a simple deterministic reduction for the gap minimum distance of code problem"
    - "new lattice based cryptographic constructions"

Connected through hyperedge HE-6 (induced by source paper "the projection games conjecture and the hardness of approximation of ssat and related problems"):
  with members:
    - "gap s eth hardness of svp"
    - "on the quantitative hardness of cvp"
    - "classical hardness of learning with errors"
    - "covering cubes and the closest vector problem"

Connected through hyperedge HE-7 (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"
    - "enumerative lattice algorithms in any norm via m ellipsoid coverings"

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.CC(Computational Complexity)