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 "eth hardness for densest k subgraph with perfect completeness"):
  Abstract: We show that, assuming the (deterministic) Exponential Time Hypothesis, distinguishing between a graph with an induced $k$-clique and a graph in which all k-subgraphs have density at most $1-\epsilon$, requires $n^{\tilde \Omega(log n)}$ time. Our result essentially matches the quasi-polynomial algorithms of Feige and Seltser [FS97] and Barman [Bar15] for this problem, and is the first one to rule out an additive PTAS for Densest $k$-Subgraph. We further strengthen this result by showing that our lower bound continues to hold when, in the soundness case, even subgraphs smaller by a near-polynomial factor ($k' = k 2^{-\tilde \Omega (log n)}$) are assumed to be at most ($1-\epsilon$)-dense. #R##N#Our reduction is inspired by recent applications of the "birthday repetition" technique [AIM14,BKW15]. Our analysis relies on information theoretical machinery and is similar in spirit to analyzing a parallel repetition of two-prover games in which the provers may choose to answer some challenges multiple times, while completely ignoring other challenges.

Includes members:
  Member "improved sum of squares lower bounds for hidden clique and hidden submatrix problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators")
  Member "can almost everybody be almost happy pcp for ppad and the inapproximability of nash":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "public bayesian persuasion being almost optimal and almost persuasive")
  Member "combining traditional marketing and viral marketing with amphibious influence maximization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximizing welfare in social networks under a utility driven influence diffusion model")
  Member "sum of squares lower bounds for planted clique":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "broadcast congested clique planted cliques and pseudorandom generators")
  Member "am with multiple merlins":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")
  Member "new algorithms for learning incoherent and overcomplete dictionaries":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "when can wasserstein gans minimize wasserstein distance")
  Member "finding endogenously formed communities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "network essence pagerank completion and centrality conforming markov chains")
  Member "finding overlapping communities in social networks toward a rigorous approach":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "inapproximability of vc dimension and littlestone s dimension")

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)