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 "gap s eth hardness of svp"):
  Abstract: We prove the following quantitative hardness results for the Shortest Vector Problem in the lp norm (SVP_p), where n is the rank of the input lattice.    For “almost all” p > p0 ≈ 2.1397, there is no 2n/Cp-time algorithm for SVP_p for some explicit (easily computable) constant Cp > 0 unless the (randomized) Strong Exponential Time Hypothesis (SETH) is false. (E.g., for p ≥ 3, Cp    For any 1 ≤ p ≤ ∞, there is no 2o(n)-time algorithm for SVP_p unless the non-uniform Gap-Exponential Time Hypothesis (Gap-ETH) is false. Furthermore, for each such p, there exists a constant γp > 1 such that the same result holds even for γp-approximate SVP_p.    For p > 2, the above statement holds under the weaker assumption of randomized Gap-ETH. I.e., there is no 2o(n)-time algorithm for γp-approximate SVP_p unless randomized Gap-ETH is false.    See http://arxiv.org/abs/1712.00942 for a complete exposition.

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 "on the quantitative hardness of cvp":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms")
  Member "a birthday repetition theorem and complexity of approximating dense csps":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")
  Member "discrete gaussian sampling reduces to cvp and svp":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms")
  Member "solving the shortest vector problem in 2 n time via discrete gaussian sampling":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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 "tensor based hardness of the shortest vector problem to within almost polynomial factors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms")
  Member "enumerative lattice algorithms in any norm via m ellipsoid coverings":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "faster provable sieving algorithms for the shortest vector problem and the closest vector problem on lattices in 120001 p norm")

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