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 "parameterized intractability of even set and shortest vector problem"):
  Abstract: The $k$-Even Set problem is a parameterized variant of the Minimum Distance Problem of linear codes over $\mathbb F_2$, which can be stated as follows: given a generator matrix $\mathbf A$ and an integer $k$, determine whether the code generated by $\mathbf A$ has distance at most $k$, or in other words, whether there is a nonzero vector $\mathbf{x}$ such that $\mathbf A \mathbf{x}$ has at most $k$ nonzero coordinates. The question of whether $k$-Even Set is fixed parameter tractable (FPT) parameterized by the distance $k$ has been repeatedly raised in literature; in fact, it is one of the few remaining open questions from the seminal book of Downey and Fellows (1999). In this work, we show that $k$-Even Set is W[1]-hard under randomized reductions. We also consider the parameterized $k$-Shortest Vector Problem (SVP), in which we are given a lattice whose basis vectors are integral and an integer $k$, and the goal is to determine whether the norm of the shortest vector (in the $\ell_p$ norm for some fixed $p$) is at most $k$. Similar to $k$-Even Set, understanding the complexity of this problem is also a long-standing open question in the field of Parameterized Complexity. We show that, for any $p > 1$, $k$-SVP is W[1]-hard to approximate (under randomized reductions) to some constant factor.

Includes members:
  Member "gap s eth hardness of svp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hardness of bounded distance decoding on lattices in ell_p norms")
  Member "parameterized complexity of csp for infinite constraint languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "uniform csp parameterized by solution size is in w 1")
  Member "on the quantitative hardness of cvp":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "parameterized inapproximability for steiner orientation by gap amplification")
  Member "on the hardness of learning sparse parities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "minimum bounded chains and minimum homologous chains in embedded simplicial complexes")
  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 "a simple deterministic reduction for the gap minimum distance of code problem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "minimum bounded chains and minimum homologous chains in embedded simplicial complexes")
  Member "new lattice based cryptographic constructions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "parameterized intractability of even set and shortest vector problem from gap eth")

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)