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 "junta correlation is testable"):
  Abstract: The problem of tolerant junta testing is a natural and challenging problem which asks if the property of a function having some specified correlation with a $k$-Junta is testable. In this paper we give an affirmative answer to this question: We show that given distance parameters $\frac{1}{2} >c_u>c_{\ell} \ge 0$, there is a tester which given oracle access to $f:\{-1,1\}^n \rightarrow \{-1,1\}$, with query complexity $ 2^k \cdot \mathsf{poly}(k,1/|c_u-c_{\ell}|)$ and distinguishes between the following cases: #R##N#$\mathbf{1.}$ The distance of $f$ from any $k$-junta is at least $c_u$; #R##N#$\mathbf{2.}$ There is a $k$-junta $g$ which has distance at most $c_\ell$ from $f$. #R##N#This is the first non-trivial tester (i.e., query complexity is independent of $n$) which works for all $1/2 > c_u > c_\ell \ge 0$. The best previously known results by Blais \emph{et~ al.}, required $c_u \ge 16 c_\ell$. In fact, with the same query complexity, we accomplish the stronger goal of identifying the most correlated $k$-junta, up to permutations of the coordinates. #R##N#We can further improve the query complexity to $\mathsf{poly}(k, 1/|c_u-c_{\ell}|)$ for the (weaker) task of distinguishing between the following cases: #R##N#$\mathbf{1.}$ The distance of $f$ from any $k'$-junta is at least $c_u$. #R##N#$\mathbf{2.}$ There is a $k$-junta $g$ which is at a distance at most $c_\ell$ from $f$. #R##N#Here $k'=O(k^2/|c_u-c_\ell|)$. #R##N#Our main tools are Fourier analysis based algorithms that simulate oracle access to influential coordinates of functions.

Includes members:
  Member "distribution free junta testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "almost optimal testers for concise representations")
  Member "near log convexity of measured heat in discrete time and consequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "almost optimal testers for concise representations")
  Member "boolean function analysis meets stochastic optimization an approximation scheme for stochastic knapsack":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "learning sums of independent random variables with sparse collective support")
  Member "settling the query complexity of non adaptive junta testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost optimal testers for concise representations")
  Member "tolerant junta testing and the connection to submodular optimization and function isomorphism":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal approximation for unconstrained non submodular minimization")
  Member "analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "coarse grained complexity for dynamic algorithms")

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)